Base | Representation |
---|---|
bin | 10110101111101010001010… |
… | …000001101001000110010011 |
3 | 111010011222100022200012221222 |
4 | 112233222022001221012103 |
5 | 101102411222111311011 |
6 | 552430040355035255 |
7 | 30033036534546356 |
oct | 2657521201510623 |
9 | 433158308605858 |
10 | 100032104010131 |
11 | 29967416978157 |
12 | b276a8529bb2b |
13 | 43a7caa3a1247 |
14 | 1a9b81886c29d |
15 | b870e7ea3ddb |
hex | 5afa8a069193 |
100032104010131 has 4 divisors (see below), whose sum is σ = 100590942580200. Its totient is φ = 99473265440064.
The previous prime is 100032104010119. The next prime is 100032104010173. The reversal of 100032104010131 is 131010401230001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100032104010131 is a prime.
It is a super-2 number, since 2×1000321040101312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100032104015131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 279419284766 + ... + 279419285123.
It is an arithmetic number, because the mean of its divisors is an integer number (25147735645050).
Almost surely, 2100032104010131 is an apocalyptic number.
100032104010131 is a deficient number, since it is larger than the sum of its proper divisors (558838570069).
100032104010131 is an equidigital number, since it uses as much as digits as its factorization.
100032104010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558838570068.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100032104010131 its reverse (131010401230001), we get a palindrome (231042505240132).
The spelling of 100032104010131 in words is "one hundred trillion, thirty-two billion, one hundred four million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •