Base | Representation |
---|---|
bin | 1001001100100110111011… |
… | …0100010011110100011011 |
3 | 1022210201101110022201012101 |
4 | 2103021232310103310123 |
5 | 2311134302312034321 |
6 | 33301253002224231 |
7 | 2062404021444262 |
oct | 223115664236433 |
9 | 38721343281171 |
10 | 10112212221211 |
11 | 32496241a0721 |
12 | 11739934b5077 |
13 | 584767a75659 |
14 | 26d6100515d9 |
15 | 12809636d791 |
hex | 9326ed13d1b |
10112212221211 has 8 divisors (see below), whose sum is σ = 10206898536240. Its totient is φ = 10017529233408.
The previous prime is 10112212221203. The next prime is 10112212221217. The reversal of 10112212221211 is 11212221221101.
It is a happy number.
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 10112212221211 - 23 = 10112212221203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112212221217) 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, 5499675 + ... + 7104283.
It is an arithmetic number, because the mean of its divisors is an integer number (1275862317030).
Almost surely, 210112212221211 is an apocalyptic number.
10112212221211 is a deficient number, since it is larger than the sum of its proper divisors (94686315029).
10112212221211 is a wasteful number, since it uses less digits than its factorization.
10112212221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1663613.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 10112212221211 its reverse (11212221221101), we get a palindrome (21324433442312).
The spelling of 10112212221211 in words is "ten trillion, one hundred twelve billion, two hundred twelve million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •