Base | Representation |
---|---|
bin | 101110101100110110… |
… | …0011100110111110111 |
3 | 100120212022120202100110 |
4 | 1131121230130313313 |
5 | 3120343000311011 |
6 | 114023330514103 |
7 | 10150154023566 |
oct | 1353154346767 |
9 | 316768522313 |
10 | 100289072631 |
11 | 39594626700 |
12 | 1752a735933 |
13 | 95c3682837 |
14 | 4bd55cbbdd |
15 | 291e7daba6 |
hex | 1759b1cdf7 |
100289072631 has 12 divisors (see below), whose sum is σ = 146980129016. Its totient is φ = 60781255920.
The previous prime is 100289072629. The next prime is 100289072633. The reversal of 100289072631 is 136270982001.
It is an interprime number because it is at equal distance from previous prime (100289072629) and next prime (100289072633).
It is not a de Polignac number, because 100289072631 - 21 = 100289072629 is a prime.
It is a super-2 number, since 2×1002890726312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100289072631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100289072633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 138138856 + ... + 138139581.
Almost surely, 2100289072631 is an apocalyptic number.
100289072631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100289072631 is a deficient number, since it is larger than the sum of its proper divisors (46691056385).
100289072631 is a wasteful number, since it uses less digits than its factorization.
100289072631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276278462 (or 276278451 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 39.
The spelling of 100289072631 in words is "one hundred billion, two hundred eighty-nine million, seventy-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •