Base | Representation |
---|---|
bin | 1001101001000010001010… |
… | …01110011111100000010110 |
3 | 2210001210210111122111211111 |
4 | 10310201011032133200112 |
5 | 10234324343210000042 |
6 | 113031354324125234 |
7 | 4315505342410054 |
oct | 464410516374026 |
9 | 83053714574744 |
10 | 21201120000022 |
11 | 6834387589786 |
12 | 2464b0423681a |
13 | baa345932841 |
14 | 5341d540d1d4 |
15 | 26b753058517 |
hex | 13484539f816 |
21201120000022 has 8 divisors (see below), whose sum is σ = 32276331940536. Its totient is φ = 10442342686512.
The previous prime is 21201120000013. The next prime is 21201120000023. The reversal of 21201120000022 is 22000002110212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×212011200000223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21201119999957 and 21201120000011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201120000023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79108656583 + ... + 79108656850.
It is an arithmetic number, because the mean of its divisors is an integer number (4034541492567).
Almost surely, 221201120000022 is an apocalyptic number.
21201120000022 is a deficient number, since it is larger than the sum of its proper divisors (11075211940514).
21201120000022 is a wasteful number, since it uses less digits than its factorization.
21201120000022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158217313502.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21201120000022 its reverse (22000002110212), we get a palindrome (43201122110234).
The spelling of 21201120000022 in words is "twenty-one trillion, two hundred one billion, one hundred twenty million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •