Base | Representation |
---|---|
bin | 101110100111100100… |
… | …1011001101001010011 |
3 | 100120101222121020021211 |
4 | 1131033021121221103 |
5 | 3120012200042321 |
6 | 113554010000551 |
7 | 10142604625156 |
oct | 1351711315123 |
9 | 316358536254 |
10 | 100112112211 |
11 | 3950374a721 |
12 | 1749b416157 |
13 | 9595b04327 |
14 | 4bb9cc5c9d |
15 | 290ded30e1 |
hex | 174f259a53 |
100112112211 has 8 divisors (see below), whose sum is σ = 100387041248. Its totient is φ = 99837360000.
The previous prime is 100112112097. The next prime is 100112112223. The reversal of 100112112211 is 112211211001.
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 100112112211 - 215 = 100112079443 is a prime.
It is a super-2 number, since 2×1001121122112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100112112191 and 100112112200.
It is not an unprimeable number, because it can be changed into a prime (100112112281) 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, 1132411 + ... + 1217611.
It is an arithmetic number, because the mean of its divisors is an integer number (12548380156).
Almost surely, 2100112112211 is an apocalyptic number.
100112112211 is a deficient number, since it is larger than the sum of its proper divisors (274929037).
100112112211 is an equidigital number, since it uses as much as digits as its factorization.
100112112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88413.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100112112211 its reverse (112211211001), we get a palindrome (212323323212).
The spelling of 100112112211 in words is "one hundred billion, one hundred twelve million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •