Base | Representation |
---|---|
bin | 101111010100001010… |
… | …1100110010101010011 |
3 | 100201021021021200220222 |
4 | 1132220111212111103 |
5 | 3131043232412011 |
6 | 114402302223255 |
7 | 10224644563532 |
oct | 1365025462523 |
9 | 321237250828 |
10 | 101608482131 |
11 | 3a101380582 |
12 | 17838584b2b |
13 | 9773b25210 |
14 | 4cbc922319 |
15 | 299a561ddb |
hex | 17a8566553 |
101608482131 has 8 divisors (see below), whose sum is σ = 115183704720. Its totient is φ = 88856000352.
The previous prime is 101608482121. The next prime is 101608482149. The reversal of 101608482131 is 131284806101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101608482131 is a prime.
It is a super-2 number, since 2×1016084821312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101608482091 and 101608482100.
It is not an unprimeable number, because it can be changed into a prime (101608482121) 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 7 ways as a sum of consecutive naturals, for example, 205684940 + ... + 205685433.
It is an arithmetic number, because the mean of its divisors is an integer number (14397963090).
Almost surely, 2101608482131 is an apocalyptic number.
101608482131 is a deficient number, since it is larger than the sum of its proper divisors (13575222589).
101608482131 is a wasteful number, since it uses less digits than its factorization.
101608482131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411370405.
The product of its (nonzero) digits is 9216, while the sum is 35.
The spelling of 101608482131 in words is "one hundred one billion, six hundred eight million, four hundred eighty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •