Base | Representation |
---|---|
bin | 1001101001010100111100… |
… | …01011000111010010010001 |
3 | 2210002202211011010102012201 |
4 | 10310222132023013102101 |
5 | 10240011020232034301 |
6 | 113040143005123201 |
7 | 4316313236025646 |
oct | 464523613072221 |
9 | 83082734112181 |
10 | 21211202221201 |
11 | 6838690751783 |
12 | 2466a58859501 |
13 | bab29167a3a5 |
14 | 5348b0455dcd |
15 | 26bb43258201 |
hex | 134a9e2c7491 |
21211202221201 has 8 divisors (see below), whose sum is σ = 21290966464320. Its totient is φ = 21131586378288.
The previous prime is 21211202221169. The next prime is 21211202221211. The reversal of 21211202221201 is 10212220211212.
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 21211202221201 - 25 = 21211202221169 is a prime.
It is a super-2 number, since 2×212112022212012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21211202221211) 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, 36813646 + ... + 37385383.
It is an arithmetic number, because the mean of its divisors is an integer number (2661370808040).
Almost surely, 221211202221201 is an apocalyptic number.
It is an amenable number.
21211202221201 is a deficient number, since it is larger than the sum of its proper divisors (79764243119).
21211202221201 is an equidigital number, since it uses as much as digits as its factorization.
21211202221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74200103.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21211202221201 its reverse (10212220211212), we get a palindrome (31423422432413).
The spelling of 21211202221201 in words is "twenty-one trillion, two hundred eleven billion, two hundred two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •