Base | Representation |
---|---|
bin | 1001101001000100001011… |
… | …01110011101001100101001 |
3 | 2210001220120220211221202021 |
4 | 10310202011232131030221 |
5 | 10234334102220333001 |
6 | 113032053541504441 |
7 | 4315544222316526 |
oct | 464420556351451 |
9 | 83056526757667 |
10 | 21202202121001 |
11 | 68348923a2240 |
12 | 2465166712121 |
13 | baa488b93605 |
14 | 53429901614d |
15 | 26b7b805bba1 |
hex | 134885b9d329 |
21202202121001 has 8 divisors (see below), whose sum is σ = 23341873896000. Its totient is φ = 19097896821840.
The previous prime is 21202202120987. The next prime is 21202202121013. The reversal of 21202202121001 is 10012120220212.
It is a happy number.
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 21202202121001 - 227 = 21202067903273 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21202202121701) 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, 8841617701 + ... + 8841620098.
It is an arithmetic number, because the mean of its divisors is an integer number (2917734237000).
Almost surely, 221202202121001 is an apocalyptic number.
It is an amenable number.
21202202121001 is a deficient number, since it is larger than the sum of its proper divisors (2139671774999).
21202202121001 is a wasteful number, since it uses less digits than its factorization.
21202202121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17683237919.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21202202121001 its reverse (10012120220212), we get a palindrome (31214322341213).
It can be divided in two parts, 2120220212 and 1001, that multiplied together give a palindrome (2122340432212).
The spelling of 21202202121001 in words is "twenty-one trillion, two hundred two billion, two hundred two million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •