Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110011110001110001011 |
3 | 1022210121021202020110002202 |
4 | 2103020213032132032023 |
5 | 2311124322321320021 |
6 | 33300533454350415 |
7 | 2062332165321434 |
oct | 223104716361613 |
9 | 38717252213082 |
10 | 10111011120011 |
11 | 32490682025aa |
12 | 11736b91bb40b |
13 | 584605c86b99 |
14 | 26d53871648b |
15 | 128025bb6a0b |
hex | 9322739e38b |
10111011120011 has 2 divisors, whose sum is σ = 10111011120012. Its totient is φ = 10111011120010.
The previous prime is 10111011119959. The next prime is 10111011120109. The reversal of 10111011120011 is 11002111011101.
It is a happy number.
10111011120011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10111011120011 - 222 = 10111006925707 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111011119974 and 10111011120001.
It is not a weakly prime, because it can be changed into another prime (10111011120211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055505560005 + 5055505560006.
It is an arithmetic number, because the mean of its divisors is an integer number (5055505560006).
Almost surely, 210111011120011 is an apocalyptic number.
10111011120011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111011120011 is an equidigital number, since it uses as much as digits as its factorization.
10111011120011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10111011120011 its reverse (11002111011101), we get a palindrome (21113122131112).
The spelling of 10111011120011 in words is "ten trillion, one hundred eleven billion, eleven million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •