Base | Representation |
---|---|
bin | 101111000101111010… |
… | …0110101101101101011 |
3 | 100200000221012000100201 |
4 | 1132023310311231223 |
5 | 3124103303213311 |
6 | 114243013413031 |
7 | 10210045640644 |
oct | 1361364655553 |
9 | 320027160321 |
10 | 101130132331 |
11 | 39986361268 |
12 | 1772433a177 |
13 | 96c89b06b7 |
14 | 4c751a46cb |
15 | 296d5739c1 |
hex | 178bd35b6b |
101130132331 has 16 divisors (see below), whose sum is σ = 103281454080. Its totient is φ = 99001450240.
The previous prime is 101130132223. The next prime is 101130132343. The reversal of 101130132331 is 133231031101.
It is a cyclic number.
It is not a de Polignac number, because 101130132331 - 221 = 101128035179 is a prime.
It is a super-2 number, since 2×1011301323312 (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 = 101130132299 and 101130132308.
It is not an unprimeable number, because it can be changed into a prime (101130132361) 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 15 ways as a sum of consecutive naturals, for example, 5981616 + ... + 5998498.
It is an arithmetic number, because the mean of its divisors is an integer number (6455090880).
Almost surely, 2101130132331 is an apocalyptic number.
101130132331 is a deficient number, since it is larger than the sum of its proper divisors (2151321749).
101130132331 is a wasteful number, since it uses less digits than its factorization.
101130132331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17546.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101130132331 its reverse (133231031101), we get a palindrome (234361163432).
The spelling of 101130132331 in words is "one hundred one billion, one hundred thirty million, one hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •