Base | Representation |
---|---|
bin | 1001101001000010010100… |
… | …00000011011110100111101 |
3 | 2210001211000002120010220212 |
4 | 10310201022000123310331 |
5 | 10234330024222413041 |
6 | 113031410311122205 |
7 | 4315510335201161 |
oct | 464411200336475 |
9 | 83054002503825 |
10 | 21201200201021 |
11 | 68344188879a5 |
12 | 2464b27073365 |
13 | baa359433559 |
14 | 534201d28ca1 |
15 | 26b75a0eb8eb |
hex | 13484a01bd3d |
21201200201021 has 8 divisors (see below), whose sum is σ = 22514548888320. Its totient is φ = 19907601118272.
The previous prime is 21201200201011. The next prime is 21201200201057. The reversal of 21201200201021 is 12010200210212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21201200201021 - 210 = 21201200199997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21201200200987 and 21201200201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201200201011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4937398925 + ... + 4937403218.
It is an arithmetic number, because the mean of its divisors is an integer number (2814318611040).
Almost surely, 221201200201021 is an apocalyptic number.
It is an amenable number.
21201200201021 is a deficient number, since it is larger than the sum of its proper divisors (1313348687299).
21201200201021 is a wasteful number, since it uses less digits than its factorization.
21201200201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9874802275.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21201200201021 its reverse (12010200210212), we get a palindrome (33211400411233).
The spelling of 21201200201021 in words is "twenty-one trillion, two hundred one billion, two hundred million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •