Base | Representation |
---|---|
bin | 10110101111001101011000… |
… | …101110000001101000101101 |
3 | 111010002000121101221011200211 |
4 | 112233031120232001220231 |
5 | 101101404440233404401 |
6 | 552403531140222421 |
7 | 30030564154113160 |
oct | 2657153056015055 |
9 | 433060541834624 |
10 | 100001212013101 |
11 | 299553041785a3 |
12 | b270aa369aa11 |
13 | 43a50c6285369 |
14 | 1a9a127b8bad7 |
15 | b863dadce951 |
hex | 5af358b81a2d |
100001212013101 has 8 divisors (see below), whose sum is σ = 114947718516864. Its totient is φ = 85219860277680.
The previous prime is 100001212013083. The next prime is 100001212013161. The reversal of 100001212013101 is 101310212100001.
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 100001212013101 - 25 = 100001212013069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001212013161) 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, 41288690785 + ... + 41288693206.
It is an arithmetic number, because the mean of its divisors is an integer number (14368464814608).
Almost surely, 2100001212013101 is an apocalyptic number.
It is an amenable number.
100001212013101 is a deficient number, since it is larger than the sum of its proper divisors (14946506503763).
100001212013101 is an equidigital number, since it uses as much as digits as its factorization.
100001212013101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82577384171.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 100001212013101 its reverse (101310212100001), we get a palindrome (201311424113102).
The spelling of 100001212013101 in words is "one hundred trillion, one billion, two hundred twelve million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •