Base | Representation |
---|---|
bin | 1001100110000101110101… |
… | …01110111000011111101001 |
3 | 2202201010211010111121120101 |
4 | 10303002322232320133221 |
5 | 10231200311111211103 |
6 | 112513113425225401 |
7 | 4305265654362352 |
oct | 463027256703751 |
9 | 82633733447511 |
10 | 21100012210153 |
11 | 67a55128a8768 |
12 | 24493a7492261 |
13 | ba0951775846 |
14 | 52d3631c2d29 |
15 | 268cd6949a1d |
hex | 1330babb87e9 |
21100012210153 has 2 divisors, whose sum is σ = 21100012210154. Its totient is φ = 21100012210152.
The previous prime is 21100012210133. The next prime is 21100012210271. The reversal of 21100012210153 is 35101221000112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13981377332224 + 7118634877929 = 3739168^2 + 2668077^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100012210153 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21100012210153.
It is not a weakly prime, because it can be changed into another prime (21100012210133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550006105076 + 10550006105077.
It is an arithmetic number, because the mean of its divisors is an integer number (10550006105077).
Almost surely, 221100012210153 is an apocalyptic number.
It is an amenable number.
21100012210153 is a deficient number, since it is larger than the sum of its proper divisors (1).
21100012210153 is an equidigital number, since it uses as much as digits as its factorization.
21100012210153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 21100012210153 its reverse (35101221000112), we get a palindrome (56201233210265).
The spelling of 21100012210153 in words is "twenty-one trillion, one hundred billion, twelve million, two hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •