Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …001101101000001100001111 |
3 | 111010001220202210221120211111 |
4 | 112233030113031220030033 |
5 | 101101400212412014411 |
6 | 552403230120432451 |
7 | 30030525010504012 |
oct | 2657142715501417 |
9 | 433056683846744 |
10 | 100000113001231 |
11 | 2995489a878723 |
12 | b270837618727 |
13 | 43a4c7c68c391 |
14 | 1a9a061c29379 |
15 | b86374691721 |
hex | 5af31736830f |
100000113001231 has 8 divisors (see below), whose sum is σ = 100431688481280. Its totient is φ = 99569088354072.
The previous prime is 100000113001207. The next prime is 100000113001333. The reversal of 100000113001231 is 132100311000001.
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 100000113001231 - 217 = 100000112870159 is a prime.
It is a super-2 number, since 2×1000001130012312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000113001531) 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, 137344351 + ... + 138070528.
It is an arithmetic number, because the mean of its divisors is an integer number (12553961060160).
Almost surely, 2100000113001231 is an apocalyptic number.
100000113001231 is a deficient number, since it is larger than the sum of its proper divisors (431575480049).
100000113001231 is a wasteful number, since it uses less digits than its factorization.
100000113001231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275416445.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 100000113001231 its reverse (132100311000001), we get a palindrome (232100424001232).
The spelling of 100000113001231 in words is "one hundred trillion, one hundred thirteen million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •