Base | Representation |
---|---|
bin | 101110100101001100… |
… | …0100110110010010001 |
3 | 100120012102020212221221 |
4 | 1131022120212302101 |
5 | 3114331221241423 |
6 | 113542033245041 |
7 | 10140614526241 |
oct | 1351230466221 |
9 | 316172225857 |
10 | 100032212113 |
11 | 39472637589 |
12 | 17478703781 |
13 | 95823aa572 |
14 | 4bad447b21 |
15 | 2906e9de5d |
hex | 174a626c91 |
100032212113 has 8 divisors (see below), whose sum is σ = 100261156320. Its totient is φ = 99803331840.
The previous prime is 100032212083. The next prime is 100032212129. The reversal of 100032212113 is 311212230001.
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 100032212113 - 229 = 99495341201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100032218113) 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 7 ways as a sum of consecutive naturals, for example, 4626993 + ... + 4648561.
It is an arithmetic number, because the mean of its divisors is an integer number (12532644540).
Almost surely, 2100032212113 is an apocalyptic number.
It is an amenable number.
100032212113 is a deficient number, since it is larger than the sum of its proper divisors (228944207).
100032212113 is an equidigital number, since it uses as much as digits as its factorization.
100032212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31967.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100032212113 its reverse (311212230001), we get a palindrome (411244442114).
The spelling of 100032212113 in words is "one hundred billion, thirty-two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •