Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0100111000011101111 |
3 | 110110011000222112012000 |
4 | 1321102120213003233 |
5 | 4113203141431111 |
6 | 135454414343343 |
7 | 12260151644520 |
oct | 1712230470357 |
9 | 413130875160 |
10 | 130231202031 |
11 | 5025a133697 |
12 | 212a61bab53 |
13 | c385a64c78 |
14 | 6436090847 |
15 | 35c32d2c56 |
hex | 1e526270ef |
130231202031 has 64 divisors (see below), whose sum is σ = 237425126400. Its totient is φ = 68853086208.
The previous prime is 130231201949. The next prime is 130231202039. The reversal of 130231202031 is 130202132031.
130231202031 is a `hidden beast` number, since 1 + 302 + 312 + 0 + 20 + 31 = 666.
It is not a de Polignac number, because 130231202031 - 223 = 130222813423 is a prime.
It is a super-2 number, since 2×1302312020312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130231201995 and 130231202013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130231202039) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 153930 + ... + 533063.
It is an arithmetic number, because the mean of its divisors is an integer number (3709767600).
Almost surely, 2130231202031 is an apocalyptic number.
130231202031 is a deficient number, since it is larger than the sum of its proper divisors (107193924369).
130231202031 is a wasteful number, since it uses less digits than its factorization.
130231202031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 687085 (or 687079 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130231202031 its reverse (130202132031), we get a palindrome (260433334062).
The spelling of 130231202031 in words is "one hundred thirty billion, two hundred thirty-one million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •