Base | Representation |
---|---|
bin | 1001101001000100011010… |
… | …10110101101000110100111 |
3 | 2210001220220211200120222022 |
4 | 10310202031112231012213 |
5 | 10234334333002044143 |
6 | 113032114353053355 |
7 | 4315550335243415 |
oct | 464421526550647 |
9 | 83056824616868 |
10 | 21202330112423 |
11 | 6834948672079 |
12 | 24651a155725b |
13 | baa4a9557a95 |
14 | 5342ac0122b5 |
15 | 26b7c43e0268 |
hex | 13488d5ad1a7 |
21202330112423 has 2 divisors, whose sum is σ = 21202330112424. Its totient is φ = 21202330112422.
The previous prime is 21202330112393. The next prime is 21202330112449. The reversal of 21202330112423 is 32421103320212.
It is an a-pointer prime, because the next prime (21202330112449) can be obtained adding 21202330112423 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21202330112423 - 228 = 21202061676967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21202330112392 and 21202330112401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21202330112923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601165056211 + 10601165056212.
It is an arithmetic number, because the mean of its divisors is an integer number (10601165056212).
Almost surely, 221202330112423 is an apocalyptic number.
21202330112423 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202330112423 is an equidigital number, since it uses as much as digits as its factorization.
21202330112423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 21202330112423 its reverse (32421103320212), we get a palindrome (53623433432635).
The spelling of 21202330112423 in words is "twenty-one trillion, two hundred two billion, three hundred thirty million, one hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •