Base | Representation |
---|---|
bin | 11001001111100100010111… |
… | …010001111011011001011011 |
3 | 112120002111121101120102001002 |
4 | 121033210113101323121123 |
5 | 104022432002023210021 |
6 | 1032042202101415215 |
7 | 32246000611226633 |
oct | 3117442721733133 |
9 | 476074541512032 |
10 | 111021000210011 |
11 | 32413818341751 |
12 | 1055074440a50b |
13 | 49c430a226568 |
14 | 1d5b6334336c3 |
15 | cc7d9e91850b |
hex | 64f91747b65b |
111021000210011 has 16 divisors (see below), whose sum is σ = 117779116573440. Its totient is φ = 104356850885280.
The previous prime is 111021000209993. The next prime is 111021000210023. The reversal of 111021000210011 is 110012000120111.
It is a cyclic number.
It is not a de Polignac number, because 111021000210011 - 242 = 106622953698907 is a prime.
It is a super-2 number, since 2×1110210002100112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111021000209974 and 111021000210001.
It is not an unprimeable number, because it can be changed into a prime (111021000210091) 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, 32780975 + ... + 36008808.
It is an arithmetic number, because the mean of its divisors is an integer number (7361194785840).
Almost surely, 2111021000210011 is an apocalyptic number.
111021000210011 is a deficient number, since it is larger than the sum of its proper divisors (6758116363429).
111021000210011 is a wasteful number, since it uses less digits than its factorization.
111021000210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68790466.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111021000210011 its reverse (110012000120111), we get a palindrome (221033000330122).
The spelling of 111021000210011 in words is "one hundred eleven trillion, twenty-one billion, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •