Base | Representation |
---|---|
bin | 101110100111100101… |
… | …0001110110110010011 |
3 | 100120102000000022012221 |
4 | 1131033022032312103 |
5 | 3120012224031011 |
6 | 113554014401511 |
7 | 10142606523412 |
oct | 1351712166623 |
9 | 316360008187 |
10 | 100112330131 |
11 | 39503889420 |
12 | 1749b500297 |
13 | 9595b7c588 |
14 | 4bb9d41479 |
15 | 290e027971 |
hex | 174f28ed93 |
100112330131 has 8 divisors (see below), whose sum is σ = 109239798384. Its totient is φ = 90989253120.
The previous prime is 100112330111. The next prime is 100112330233. The reversal of 100112330131 is 131033211001.
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 100112330131 - 25 = 100112330099 is a prime.
It is a super-2 number, since 2×1001123301312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100112330111) 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, 1050046 + ... + 1141411.
It is an arithmetic number, because the mean of its divisors is an integer number (13654974798).
Almost surely, 2100112330131 is an apocalyptic number.
100112330131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100112330131 is a deficient number, since it is larger than the sum of its proper divisors (9127468253).
100112330131 is a wasteful number, since it uses less digits than its factorization.
100112330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2195621.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 100112330131 its reverse (131033211001), we get a palindrome (231145541132).
The spelling of 100112330131 in words is "one hundred billion, one hundred twelve million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •