Base | Representation |
---|---|
bin | 101110101000001000… |
… | …1110101110110010110 |
3 | 100120110022100000112010 |
4 | 1131100101311312112 |
5 | 3120032030231402 |
6 | 113555525005050 |
7 | 10143225216243 |
oct | 1352021656626 |
9 | 316408300463 |
10 | 100131102102 |
11 | 39513440049 |
12 | 174a5853786 |
13 | 9599a22a55 |
14 | 4bbc62a5ca |
15 | 29109d4a6c |
hex | 1750475d96 |
100131102102 has 8 divisors (see below), whose sum is σ = 200262204216. Its totient is φ = 33377034032.
The previous prime is 100131102101. The next prime is 100131102119. The reversal of 100131102102 is 201201131001.
It is a sphenic number, since it is the product of 3 distinct primes.
100131102102 is an admirable number.
It is a super-2 number, since 2×1001311021022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100131102101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8344258503 + ... + 8344258514.
It is an arithmetic number, because the mean of its divisors is an integer number (25032775527).
Almost surely, 2100131102102 is an apocalyptic number.
100131102102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100131102102 is a wasteful number, since it uses less digits than its factorization.
100131102102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16688517022.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 100131102102 its reverse (201201131001), we get a palindrome (301332233103).
The spelling of 100131102102 in words is "one hundred billion, one hundred thirty-one million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •