Base | Representation |
---|---|
bin | 10000001010110000100… |
… | …110111100001111110111 |
3 | 10221012211222222200111122 |
4 | 100022300212330033313 |
5 | 121200430011420011 |
6 | 2210225505254155 |
7 | 143162133640544 |
oct | 20126046741767 |
9 | 3835758880448 |
10 | 1111064560631 |
11 | 399221a85183 |
12 | 15b3b933435b |
13 | 80a081b867c |
14 | 3bac0b81bcb |
15 | 1dd7c0443db |
hex | 102b09bc3f7 |
1111064560631 has 2 divisors, whose sum is σ = 1111064560632. Its totient is φ = 1111064560630.
The previous prime is 1111064560609. The next prime is 1111064560643. The reversal of 1111064560631 is 1360654601111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111064560631 is a prime.
It is a super-2 number, since 2×11110645606312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111064560591 and 1111064560600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111064560601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555532280315 + 555532280316.
It is an arithmetic number, because the mean of its divisors is an integer number (555532280316).
Almost surely, 21111064560631 is an apocalyptic number.
1111064560631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111064560631 is an equidigital number, since it uses as much as digits as its factorization.
1111064560631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
The spelling of 1111064560631 in words is "one trillion, one hundred eleven billion, sixty-four million, five hundred sixty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •