Base | Representation |
---|---|
bin | 11100000011111101… |
… | …000100000011110011 |
3 | 2212202212222222122220 |
4 | 130003331010003303 |
5 | 443202031011011 |
6 | 21501514132123 |
7 | 2114451132063 |
oct | 340375040363 |
9 | 85685888586 |
10 | 30131110131 |
11 | 11862254011 |
12 | 5a0aa21043 |
13 | 2ac25abc65 |
14 | 165ba173a3 |
15 | bb53c6506 |
hex | 703f440f3 |
30131110131 has 16 divisors (see below), whose sum is σ = 42545977344. Its totient is φ = 18902265984.
The previous prime is 30131110069. The next prime is 30131110133. The reversal of 30131110131 is 13101113103.
It is not a de Polignac number, because 30131110131 - 213 = 30131101939 is a prime.
It is a super-2 number, since 2×301311101312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30131110131.
It is not an unprimeable number, because it can be changed into a prime (30131110133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 235686 + ... + 340308.
It is an arithmetic number, because the mean of its divisors is an integer number (2659123584).
Almost surely, 230131110131 is an apocalyptic number.
30131110131 is a deficient number, since it is larger than the sum of its proper divisors (12414867213).
30131110131 is a wasteful number, since it uses less digits than its factorization.
30131110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110290.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 30131110131 its reverse (13101113103), we get a palindrome (43232223234).
The spelling of 30131110131 in words is "thirty billion, one hundred thirty-one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •