Base | Representation |
---|---|
bin | 1001111010100001… |
… | …0000011010101011 |
3 | 20212110210202011111 |
4 | 2132220100122223 |
5 | 20422301300011 |
6 | 1120030011151 |
7 | 122644062013 |
oct | 23650203253 |
9 | 6773722144 |
10 | 2661353131 |
11 | 114629aaa8 |
12 | 623346ab7 |
13 | 3354a4a88 |
14 | 1b3652c43 |
15 | 10899e121 |
hex | 9ea106ab |
2661353131 has 16 divisors (see below), whose sum is σ = 2849511168. Its totient is φ = 2480976000.
The previous prime is 2661353083. The next prime is 2661353141. The reversal of 2661353131 is 1313531662.
It is a cyclic number.
It is not a de Polignac number, because 2661353131 - 27 = 2661353003 is a prime.
It is a super-2 number, since 2×26613531312 = 14165600975767006322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2661353093 and 2661353102.
It is not an unprimeable number, because it can be changed into a prime (2661353141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104361 + ... + 127333.
It is an arithmetic number, because the mean of its divisors is an integer number (178094448).
Almost surely, 22661353131 is an apocalyptic number.
2661353131 is a deficient number, since it is larger than the sum of its proper divisors (188158037).
2661353131 is a wasteful number, since it uses less digits than its factorization.
2661353131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23142.
The product of its digits is 9720, while the sum is 31.
The square root of 2661353131 is about 51588.3042074461. The cubic root of 2661353131 is about 1385.8008863039.
Adding to 2661353131 its reverse (1313531662), we get a palindrome (3974884793).
The spelling of 2661353131 in words is "two billion, six hundred sixty-one million, three hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •