Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …1110111010001111110111 |
3 | 1100011021110222122020022100 |
4 | 2110212312232322033313 |
5 | 2314304042432404421 |
6 | 33415231000033143 |
7 | 2102543624242101 |
oct | 224466656721767 |
9 | 40137428566270 |
10 | 10212203013111 |
11 | 3287a75407620 |
12 | 118b23a1627b3 |
13 | 5910116acac8 |
14 | 2743b7b96571 |
15 | 12a999889c26 |
hex | 949b6bba3f7 |
10212203013111 has 96 divisors (see below), whose sum is σ = 17204473488384. Its totient is φ = 5774611392000.
The previous prime is 10212203013097. The next prime is 10212203013113. The reversal of 10212203013111 is 11131030221201.
10212203013111 is a `hidden beast` number, since 10 + 21 + 2 + 20 + 301 + 311 + 1 = 666.
It is not a de Polignac number, because 10212203013111 - 210 = 10212203012087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212203013113) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 860838966 + ... + 860850828.
It is an arithmetic number, because the mean of its divisors is an integer number (179213265504).
Almost surely, 210212203013111 is an apocalyptic number.
10212203013111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10212203013111 is a deficient number, since it is larger than the sum of its proper divisors (6992270475273).
10212203013111 is a wasteful number, since it uses less digits than its factorization.
10212203013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21165 (or 21162 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10212203013111 its reverse (11131030221201), we get a palindrome (21343233234312).
The spelling of 10212203013111 in words is "ten trillion, two hundred twelve billion, two hundred three million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •