Base | Representation |
---|---|
bin | 1001010010010110111110… |
… | …1111101000101111010001 |
3 | 1100011011101222120120112212 |
4 | 2110211233233220233101 |
5 | 2314244123034134301 |
6 | 33414512453001505 |
7 | 2102502253052345 |
oct | 224455757505721 |
9 | 40134358516485 |
10 | 10211012021201 |
11 | 32875140a3792 |
12 | 118ab67323295 |
13 | 590b81a20874 |
14 | 27430392d625 |
15 | 12a92a02d4bb |
hex | 9496fbe8bd1 |
10211012021201 has 8 divisors (see below), whose sum is σ = 10812019294080. Its totient is φ = 9610044693568.
The previous prime is 10211012021183. The next prime is 10211012021209. The reversal of 10211012021201 is 10212021011201.
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 10211012021201 - 210 = 10211012020177 is a prime.
It is a super-2 number, since 2×102110120212012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10211012021209) 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, 9459221 + ... + 10483266.
It is an arithmetic number, because the mean of its divisors is an integer number (1351502411760).
Almost surely, 210211012021201 is an apocalyptic number.
It is an amenable number.
10211012021201 is a deficient number, since it is larger than the sum of its proper divisors (601007272879).
10211012021201 is a wasteful number, since it uses less digits than its factorization.
10211012021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19972623.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10211012021201 its reverse (10212021011201), we get a palindrome (20423033032402).
The spelling of 10211012021201 in words is "ten trillion, two hundred eleven billion, twelve million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •