Base | Representation |
---|---|
bin | 1001100111111010100000… |
… | …10010111100001111011011 |
3 | 2202221010111112110100012200 |
4 | 10303331100102330033123 |
5 | 10233212102124310021 |
6 | 113001553200141243 |
7 | 4312644135400200 |
oct | 463752022741733 |
9 | 82833445410180 |
10 | 21162651010011 |
11 | 681a036871155 |
12 | 2459569007823 |
13 | ba6824b0c164 |
14 | 5323c62d7ca7 |
15 | 26a750b94126 |
hex | 133f504bc3db |
21162651010011 has 72 divisors (see below), whose sum is σ = 37448152045200. Its totient is φ = 11451081922560.
The previous prime is 21162651010001. The next prime is 21162651010013. The reversal of 21162651010011 is 11001015626112.
21162651010011 is a `hidden beast` number, since 2 + 1 + 1 + 6 + 2 + 651 + 0 + 1 + 0 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 21162651010011 - 26 = 21162651009947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21162651010013) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 17245731 + ... + 18432051.
It is an arithmetic number, because the mean of its divisors is an integer number (520113222850).
Almost surely, 221162651010011 is an apocalyptic number.
21162651010011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21162651010011 is a deficient number, since it is larger than the sum of its proper divisors (16285501035189).
21162651010011 is a wasteful number, since it uses less digits than its factorization.
21162651010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188489 (or 1188479 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 27.
Adding to 21162651010011 its reverse (11001015626112), we get a palindrome (32163666636123).
The spelling of 21162651010011 in words is "twenty-one trillion, one hundred sixty-two billion, six hundred fifty-one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •