Base | Representation |
---|---|
bin | 10110101111100000110110… |
… | …011001110010101010001011 |
3 | 111010011000112220021210202111 |
4 | 112233200312121302222023 |
5 | 101102230240421320021 |
6 | 552421305024443151 |
7 | 30032234104436053 |
oct | 2657406631625213 |
9 | 433130486253674 |
10 | 100022111120011 |
11 | 29963159179983 |
12 | b274b567794b7 |
13 | 43a7077003002 |
14 | 1a9b14b63a563 |
15 | b86c10a4c8e1 |
hex | 5af836672a8b |
100022111120011 has 8 divisors (see below), whose sum is σ = 100453750693920. Its totient is φ = 99590491718592.
The previous prime is 100022111119991. The next prime is 100022111120059. The reversal of 100022111120011 is 110021111220001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100022111120011 - 27 = 100022111119883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100022111119973 and 100022111120000.
It is not an unprimeable number, because it can be changed into a prime (100022111120411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4937485 + ... + 14980753.
It is an arithmetic number, because the mean of its divisors is an integer number (12556718836740).
Almost surely, 2100022111120011 is an apocalyptic number.
100022111120011 is a deficient number, since it is larger than the sum of its proper divisors (431639573909).
100022111120011 is a wasteful number, since it uses less digits than its factorization.
100022111120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10086245.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100022111120011 its reverse (110021111220001), we get a palindrome (210043222340012).
The spelling of 100022111120011 in words is "one hundred trillion, twenty-two billion, one hundred eleven million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •