Base | Representation |
---|---|
bin | 1001100011110100101101… |
… | …11011000001000111111001 |
3 | 2202102200201102200212110212 |
4 | 10301322112323001013321 |
5 | 10223411231103000441 |
6 | 112413230443120505 |
7 | 4266540166462025 |
oct | 461722673010771 |
9 | 82380642625425 |
10 | 21022102000121 |
11 | 6775472596832 |
12 | 2436283513135 |
13 | b964b6595551 |
14 | 529691bd7385 |
15 | 266c76b77eeb |
hex | 131e96ec11f9 |
21022102000121 has 8 divisors (see below), whose sum is σ = 22157760310080. Its totient is φ = 19889366879088.
The previous prime is 21022102000111. The next prime is 21022102000127. The reversal of 21022102000121 is 12100020122012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21022102000121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21022102000096 and 21022102000105.
It is not an unprimeable number, because it can be changed into a prime (21022102000127) 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, 730782461 + ... + 730811226.
It is an arithmetic number, because the mean of its divisors is an integer number (2769720038760).
Almost surely, 221022102000121 is an apocalyptic number.
It is an amenable number.
21022102000121 is a deficient number, since it is larger than the sum of its proper divisors (1135658309959).
21022102000121 is a wasteful number, since it uses less digits than its factorization.
21022102000121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1461594463.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21022102000121 its reverse (12100020122012), we get a palindrome (33122122122133).
The spelling of 21022102000121 in words is "twenty-one trillion, twenty-two billion, one hundred two million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •