Base | Representation |
---|---|
bin | 1001100011100010010001… |
… | …01110010101111110011111 |
3 | 2202101202011100120020211100 |
4 | 10301301020232111332133 |
5 | 10223230441212321343 |
6 | 112404512123324143 |
7 | 4266036623052354 |
oct | 461611056257637 |
9 | 82352140506740 |
10 | 21012200120223 |
11 | 67712511a9914 |
12 | 243437b380653 |
13 | b95599011010 |
14 | 528dd2ad662b |
15 | 2668976ec9d3 |
hex | 131c48b95f9f |
21012200120223 has 24 divisors (see below), whose sum is σ = 32687194411872. Its totient is φ = 12929971589568.
The previous prime is 21012200120183. The next prime is 21012200120231. The reversal of 21012200120223 is 32202100221012.
21012200120223 is a `hidden beast` number, since 2 + 101 + 220 + 0 + 120 + 223 = 666.
It is not a de Polignac number, because 21012200120223 - 213 = 21012200112031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21012200120196 and 21012200120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012200120623) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1773336 + ... + 6720797.
It is an arithmetic number, because the mean of its divisors is an integer number (1361966433828).
Almost surely, 221012200120223 is an apocalyptic number.
21012200120223 is a deficient number, since it is larger than the sum of its proper divisors (11674994291649).
21012200120223 is a wasteful number, since it uses less digits than its factorization.
21012200120223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8515295 (or 8515292 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 21012200120223 its reverse (32202100221012), we get a palindrome (53214300341235).
The spelling of 21012200120223 in words is "twenty-one trillion, twelve billion, two hundred million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •