Base | Representation |
---|---|
bin | 1001001100100110100101… |
… | …0101010100001001011011 |
3 | 1022210201011001012001120011 |
4 | 2103021221111110021123 |
5 | 2311134110233210021 |
6 | 33301235514142351 |
7 | 2062401523404121 |
oct | 223115125241133 |
9 | 38721131161504 |
10 | 10112120210011 |
11 | 3249587266306 |
12 | 11739687219b7 |
13 | 58475199b161 |
14 | 26d601b3d911 |
15 | 12808d245de1 |
hex | 9326955425b |
10112120210011 has 8 divisors (see below), whose sum is σ = 10116598989744. Its totient is φ = 10107642367200.
The previous prime is 10112120209993. The next prime is 10112120210033. The reversal of 10112120210011 is 11001202121101.
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 10112120210011 - 27 = 10112120209883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10112120209973 and 10112120210000.
It is not an unprimeable number, because it can be changed into a prime (10112120210111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21813540 + ... + 22272286.
It is an arithmetic number, because the mean of its divisors is an integer number (1264574873718).
Almost surely, 210112120210011 is an apocalyptic number.
10112120210011 is a deficient number, since it is larger than the sum of its proper divisors (4478779733).
10112120210011 is an equidigital number, since it uses as much as digits as its factorization.
10112120210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468461.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10112120210011 its reverse (11001202121101), we get a palindrome (21113322331112).
The spelling of 10112120210011 in words is "ten trillion, one hundred twelve billion, one hundred twenty million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •