Base | Representation |
---|---|
bin | 1001100011100000000010… |
… | …10100101011101110010111 |
3 | 2202101122001212111011121100 |
4 | 10301300001110223232113 |
5 | 10223221013031224343 |
6 | 112404153212121143 |
7 | 4265665136023323 |
oct | 461600124535627 |
9 | 82348055434540 |
10 | 21011002211223 |
11 | 6770796aa1082 |
12 | 24340a61661b3 |
13 | b95437a9c51b |
14 | 528d1b98c983 |
15 | 2668274769d3 |
hex | 131c0152bb97 |
21011002211223 has 12 divisors (see below), whose sum is σ = 30354118165800. Its totient is φ = 14005076615376.
The previous prime is 21011002211209. The next prime is 21011002211263. The reversal of 21011002211223 is 32211220011012.
21011002211223 is a `hidden beast` number, since 210 + 1 + 10 + 0 + 221 + 1 + 223 = 666.
It is not a de Polignac number, because 21011002211223 - 29 = 21011002210711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21011002211196 and 21011002211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011002211263) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 188123748 + ... + 188235401.
It is an arithmetic number, because the mean of its divisors is an integer number (2529509847150).
Almost surely, 221011002211223 is an apocalyptic number.
21011002211223 is a deficient number, since it is larger than the sum of its proper divisors (9343115954577).
21011002211223 is a wasteful number, since it uses less digits than its factorization.
21011002211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376365358 (or 376365355 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 21011002211223 its reverse (32211220011012), we get a palindrome (53222222222235).
The spelling of 21011002211223 in words is "twenty-one trillion, eleven billion, two million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •