Base | Representation |
---|---|
bin | 1001001101001000000101… |
… | …0011000010101100100011 |
3 | 1022211120100201012120200012 |
4 | 2103102001103002230203 |
5 | 2311311014210431034 |
6 | 33305324051515135 |
7 | 2063140411153220 |
oct | 223220123025443 |
9 | 38746321176605 |
10 | 10121112202019 |
11 | 3252380a87a65 |
12 | 1175657bb8aab |
13 | 5855558a64a0 |
14 | 26dc1606c947 |
15 | 12841788ecce |
hex | 934814c2b23 |
10121112202019 has 16 divisors (see below), whose sum is σ = 12456905583360. Its totient is φ = 8007815170080.
The previous prime is 10121112202013. The next prime is 10121112202021. The reversal of 10121112202019 is 91020221112101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10121112202019 - 220 = 10121111153443 is a prime.
It is a super-2 number, since 2×101211122020192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121112201985 and 10121112202003.
It is not an unprimeable number, because it can be changed into a prime (10121112202013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7330784 + ... + 8601314.
It is an arithmetic number, because the mean of its divisors is an integer number (778556598960).
Almost surely, 210121112202019 is an apocalyptic number.
10121112202019 is a deficient number, since it is larger than the sum of its proper divisors (2335793381341).
10121112202019 is a wasteful number, since it uses less digits than its factorization.
10121112202019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358090.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 10121112202019 in words is "ten trillion, one hundred twenty-one billion, one hundred twelve million, two hundred two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •