Base | Representation |
---|---|
bin | 1001001100100110111000… |
… | …0110011111011100100011 |
3 | 1022210201100121201111012112 |
4 | 2103021232012133130203 |
5 | 2311134241223211321 |
6 | 33301251452545535 |
7 | 2062403514400631 |
oct | 223115606373443 |
9 | 38721317644175 |
10 | 10112200210211 |
11 | 3249618437680 |
12 | 117398b4822ab |
13 | 58476542b658 |
14 | 26d60c606351 |
15 | 128095299a5b |
hex | 9326e19f723 |
10112200210211 has 32 divisors (see below), whose sum is σ = 12100719237120. Its totient is φ = 8342819366400.
The previous prime is 10112200210201. The next prime is 10112200210271. The reversal of 10112200210211 is 11201200221101.
It is a cyclic number.
It is not a de Polignac number, because 10112200210211 - 222 = 10112196015907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112200210201) 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 31 ways as a sum of consecutive naturals, for example, 1542941 + ... + 4754478.
It is an arithmetic number, because the mean of its divisors is an integer number (378147476160).
Almost surely, 210112200210211 is an apocalyptic number.
10112200210211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10112200210211 is a deficient number, since it is larger than the sum of its proper divisors (1988519026909).
10112200210211 is a wasteful number, since it uses less digits than its factorization.
10112200210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6297755.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10112200210211 its reverse (11201200221101), we get a palindrome (21313400431312).
The spelling of 10112200210211 in words is "ten trillion, one hundred twelve billion, two hundred million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •