Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …1110111111000011110111 |
3 | 1022102002121200211211202102 |
4 | 2101202100232333003313 |
5 | 2302324234144213421 |
6 | 33134240353132315 |
7 | 2051361611140505 |
oct | 221422056770367 |
9 | 38362550754672 |
10 | 10001112101111 |
11 | 32064a206404a |
12 | 115634825a09b |
13 | 577140685211 |
14 | 2680b0adb675 |
15 | 1252428b960b |
hex | 91890bbf0f7 |
10001112101111 has 2 divisors, whose sum is σ = 10001112101112. Its totient is φ = 10001112101110.
The previous prime is 10001112101107. The next prime is 10001112101159. The reversal of 10001112101111 is 11110121110001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001112101111 - 22 = 10001112101107 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001112101092 and 10001112101101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001112101611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000556050555 + 5000556050556.
It is an arithmetic number, because the mean of its divisors is an integer number (5000556050556).
Almost surely, 210001112101111 is an apocalyptic number.
10001112101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001112101111 is an equidigital number, since it uses as much as digits as its factorization.
10001112101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10001112101111 its reverse (11110121110001), we get a palindrome (21111233211112).
The spelling of 10001112101111 in words is "ten trillion, one billion, one hundred twelve million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •