Base | Representation |
---|---|
bin | 101111000101111100… |
… | …1000001101101001111 |
3 | 100200001000020210010021 |
4 | 1132023321001231033 |
5 | 3124104043330111 |
6 | 114243053123011 |
7 | 10210061162146 |
oct | 1361371015517 |
9 | 320030223107 |
10 | 101131230031 |
11 | 39986a40a57 |
12 | 17724789467 |
13 | 96c8ca6220 |
14 | 4c753ac75d |
15 | 296d6ddd71 |
hex | 178be41b4f |
101131230031 has 8 divisors (see below), whose sum is σ = 108913518000. Its totient is φ = 93349365312.
The previous prime is 101131229993. The next prime is 101131230041. The reversal of 101131230031 is 130032131101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101131230031 - 211 = 101131227983 is a prime.
It is a super-2 number, since 2×1011312300312 (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 = 101131229987 and 101131230014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101131230041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 533595 + ... + 697843.
It is an arithmetic number, because the mean of its divisors is an integer number (13614189750).
Almost surely, 2101131230031 is an apocalyptic number.
101131230031 is a deficient number, since it is larger than the sum of its proper divisors (7782287969).
101131230031 is a wasteful number, since it uses less digits than its factorization.
101131230031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211625.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 101131230031 its reverse (130032131101), we get a palindrome (231163361132).
The spelling of 101131230031 in words is "one hundred one billion, one hundred thirty-one million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •