Base | Representation |
---|---|
bin | 1001001100100110100101… |
… | …1000010101010011110101 |
3 | 1022210201011002200020212122 |
4 | 2103021221120111103311 |
5 | 2311134110434014310 |
6 | 33301235543125325 |
7 | 2062401533210606 |
oct | 223115130252365 |
9 | 38721132606778 |
10 | 10112121001205 |
11 | 3249587756793 |
12 | 1173968a43845 |
13 | 584751bb7312 |
14 | 26d601ca7dad |
15 | 12808d350555 |
hex | 932696154f5 |
10112121001205 has 24 divisors (see below), whose sum is σ = 12687640064568. Its totient is φ = 7736404793216.
The previous prime is 10112121001139. The next prime is 10112121001247. The reversal of 10112121001205 is 50210012121101.
It can be written as a sum of positive squares in 4 ways, for example, as 89318495044 + 10022802506161 = 298862^2 + 3165881^2 .
It is not a de Polignac number, because 10112121001205 - 222 = 10112116806901 is a prime.
It is a super-2 number, since 2×101121210012052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12769199 + ... + 13537971.
It is an arithmetic number, because the mean of its divisors is an integer number (528651669357).
Almost surely, 210112121001205 is an apocalyptic number.
It is an amenable number.
10112121001205 is a deficient number, since it is larger than the sum of its proper divisors (2575519063363).
10112121001205 is an equidigital number, since it uses as much as digits as its factorization.
10112121001205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 773797 (or 773774 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 10112121001205 its reverse (50210012121101), we get a palindrome (60322133122306).
The spelling of 10112121001205 in words is "ten trillion, one hundred twelve billion, one hundred twenty-one million, one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •