Base | Representation |
---|---|
bin | 10110110010001111111100… |
… | …001000100111011010101011 |
3 | 111010210222211000022010012202 |
4 | 112302033330020213122223 |
5 | 101113320302144200021 |
6 | 553043520122130415 |
7 | 30051640665420344 |
oct | 2662177410473253 |
9 | 433728730263182 |
10 | 100210112100011 |
11 | 29a25962898821 |
12 | b2a5483950a0b |
13 | 43bba08441744 |
14 | 1aa62a3cb70cb |
15 | b8ba65896a0b |
hex | 5b23fc2276ab |
100210112100011 has 8 divisors (see below), whose sum is σ = 101900033257248. Its totient is φ = 98521711344000.
The previous prime is 100210112099987. The next prime is 100210112100121. The reversal of 100210112100011 is 110001211012001.
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 100210112100011 - 222 = 100210107905707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100210112099965 and 100210112100001.
It is not an unprimeable number, because it can be changed into a prime (100210112100311) 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, 379967375 + ... + 380231016.
It is an arithmetic number, because the mean of its divisors is an integer number (12737504157156).
Almost surely, 2100210112100011 is an apocalyptic number.
100210112100011 is a deficient number, since it is larger than the sum of its proper divisors (1689921157237).
100210112100011 is an equidigital number, since it uses as much as digits as its factorization.
100210112100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 760200613.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100210112100011 its reverse (110001211012001), we get a palindrome (210211323112012).
The spelling of 100210112100011 in words is "one hundred trillion, two hundred ten billion, one hundred twelve million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •