Base | Representation |
---|---|
bin | 101110100111010001… |
… | …1001111101101001111 |
3 | 100120101021210001212201 |
4 | 1131032203033231033 |
5 | 3120002120010111 |
6 | 113553011342331 |
7 | 10142423616250 |
oct | 1351643175517 |
9 | 316337701781 |
10 | 100102110031 |
11 | 394a9038960 |
12 | 17497bb19a7 |
13 | 9593a11791 |
14 | 4bb8840b27 |
15 | 290d1a96c1 |
hex | 174e8cfb4f |
100102110031 has 32 divisors (see below), whose sum is σ = 125976821760. Its totient is φ = 77270652000.
The previous prime is 100102110029. The next prime is 100102110041. The reversal of 100102110031 is 130011201001.
It is a cyclic number.
It is not a de Polignac number, because 100102110031 - 21 = 100102110029 is a prime.
It is a super-2 number, since 2×1001021100312 (a number of 23 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 (100102110011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4255380 + ... + 4278838.
It is an arithmetic number, because the mean of its divisors is an integer number (3936775680).
Almost surely, 2100102110031 is an apocalyptic number.
100102110031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100102110031 is a deficient number, since it is larger than the sum of its proper divisors (25874711729).
100102110031 is a wasteful number, since it uses less digits than its factorization.
100102110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23995.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 100102110031 its reverse (130011201001), we get a palindrome (230113311032).
The spelling of 100102110031 in words is "one hundred billion, one hundred two million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •