Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …111011001110111101011011 |
3 | 111010110121121021001100212111 |
4 | 112300310210323032331123 |
5 | 101110213400111210021 |
6 | 552530453513053151 |
7 | 30041565663210214 |
oct | 2660644473167533 |
9 | 433417537040774 |
10 | 100112012210011 |
11 | 299982a1a8346a |
12 | b28a4663b71b7 |
13 | 43b26a34a3959 |
14 | 1aa163934c40b |
15 | b8922338c8e1 |
hex | 5b0d24ecef5b |
100112012210011 has 4 divisors (see below), whose sum is σ = 100113294476800. Its totient is φ = 100110729943224.
The previous prime is 100112012209961. The next prime is 100112012210029. The reversal of 100112012210011 is 110012210211001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100112012210011 - 29 = 100112012209499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100112012209973 and 100112012210000.
It is not an unprimeable number, because it can be changed into a prime (100112012210611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 641016276 + ... + 641172433.
It is an arithmetic number, because the mean of its divisors is an integer number (25028323619200).
Almost surely, 2100112012210011 is an apocalyptic number.
100112012210011 is a deficient number, since it is larger than the sum of its proper divisors (1282266789).
100112012210011 is an equidigital number, since it uses as much as digits as its factorization.
100112012210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282266788.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100112012210011 its reverse (110012210211001), we get a palindrome (210124222421012).
The spelling of 100112012210011 in words is "one hundred trillion, one hundred twelve billion, twelve million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •