Base | Representation |
---|---|
bin | 1001010010010111010110… |
… | …1001001101110001110001 |
3 | 1100011011122212211021120210 |
4 | 2110211311221031301301 |
5 | 2314244323404014301 |
6 | 33414530350254333 |
7 | 2102504564265645 |
oct | 224456551156161 |
9 | 40134585737523 |
10 | 10211111001201 |
11 | 3287564a58940 |
12 | 118ab944b73a9 |
13 | 590b99398006 |
14 | 274312b36c25 |
15 | 12a933a80ad6 |
hex | 94975a4dc71 |
10211111001201 has 32 divisors (see below), whose sum is σ = 14916670272000. Its totient is φ = 6161882284800.
The previous prime is 10211111001149. The next prime is 10211111001227. The reversal of 10211111001201 is 10210011111201.
10211111001201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10211111001201 - 27 = 10211111001073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10211111001701) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6414166 + ... + 7846256.
It is an arithmetic number, because the mean of its divisors is an integer number (466145946000).
Almost surely, 210211111001201 is an apocalyptic number.
10211111001201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10211111001201 is a deficient number, since it is larger than the sum of its proper divisors (4705559270799).
10211111001201 is a wasteful number, since it uses less digits than its factorization.
10211111001201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1433037.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10211111001201 its reverse (10210011111201), we get a palindrome (20421122112402).
The spelling of 10211111001201 in words is "ten trillion, two hundred eleven billion, one hundred eleven million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •