Base | Representation |
---|---|
bin | 10110101111101010000101… |
… | …101011101000000111111110 |
3 | 111010011222011020112112100221 |
4 | 112233222011223220013332 |
5 | 101102411044432130420 |
6 | 552430025233011554 |
7 | 30033034661226232 |
oct | 2657520553500776 |
9 | 433158136475327 |
10 | 100032031130110 |
11 | 2996738981a332 |
12 | b276a649b3bba |
13 | 43a7c98264881 |
14 | 1a9b80ccda5c2 |
15 | b870e18a9caa |
hex | 5afa85ae81fe |
100032031130110 has 16 divisors (see below), whose sum is σ = 189534374773200. Its totient is φ = 37906874954496.
The previous prime is 100032031130089. The next prime is 100032031130131. The reversal of 100032031130110 is 11031130230001.
It is an interprime number because it is at equal distance from previous prime (100032031130089) and next prime (100032031130131).
It is a super-2 number, since 2×1000320311301102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263242186995 + ... + 263242187374.
It is an arithmetic number, because the mean of its divisors is an integer number (11845898423325).
Almost surely, 2100032031130110 is an apocalyptic number.
100032031130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100032031130110 is a deficient number, since it is larger than the sum of its proper divisors (89502343643090).
100032031130110 is a wasteful number, since it uses less digits than its factorization.
100032031130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526484374395.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 100032031130110 its reverse (11031130230001), we get a palindrome (111063161360111).
The spelling of 100032031130110 in words is "one hundred trillion, thirty-two billion, thirty-one million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •