Base | Representation |
---|---|
bin | 1001010010011011011100… |
… | …1101011010101010011001 |
3 | 1100011021111112200112020212 |
4 | 2110212313031122222121 |
5 | 2314304102004311301 |
6 | 33415231443300505 |
7 | 2102544052230164 |
oct | 224466715325231 |
9 | 40137445615225 |
10 | 10212211010201 |
11 | 3287a79979992 |
12 | 118b24097a735 |
13 | 59101324cb05 |
14 | 2743b8c78adb |
15 | 12a99a4194bb |
hex | 949b735aa99 |
10212211010201 has 8 divisors (see below), whose sum is σ = 10553166712704. Its totient is φ = 9875958145200.
The previous prime is 10212211010179. The next prime is 10212211010227. The reversal of 10212211010201 is 10201011221201.
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 10212211010201 - 222 = 10212206815897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10212261010201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1175704961 + ... + 1175713646.
It is an arithmetic number, because the mean of its divisors is an integer number (1319145839088).
Almost surely, 210212211010201 is an apocalyptic number.
It is an amenable number.
10212211010201 is a deficient number, since it is larger than the sum of its proper divisors (340955702503).
10212211010201 is a wasteful number, since it uses less digits than its factorization.
10212211010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2351418751.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10212211010201 its reverse (10201011221201), we get a palindrome (20413222231402).
The spelling of 10212211010201 in words is "ten trillion, two hundred twelve billion, two hundred eleven million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •