Base | Representation |
---|---|
bin | 11100000010110100… |
… | …001101011101100011 |
3 | 2212201120001201010120 |
4 | 130002310031131203 |
5 | 443132133342011 |
6 | 21455552531323 |
7 | 2114126610555 |
oct | 340264153543 |
9 | 85646051116 |
10 | 30112012131 |
11 | 1185249a443 |
12 | 5a04550b43 |
13 | 2abb653276 |
14 | 16592854d5 |
15 | bb38a2a06 |
hex | 702d0d763 |
30112012131 has 8 divisors (see below), whose sum is σ = 40150712400. Its totient is φ = 20073993312.
The previous prime is 30112012121. The next prime is 30112012153. The reversal of 30112012131 is 13121021103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30112012131 - 26 = 30112012067 is a prime.
It is a super-2 number, since 2×301120121312 (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 30112012131.
It is not an unprimeable number, because it can be changed into a prime (30112012121) 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 7 ways as a sum of consecutive naturals, for example, 56356 + ... + 251793.
It is an arithmetic number, because the mean of its divisors is an integer number (5018839050).
Almost surely, 230112012131 is an apocalyptic number.
30112012131 is a deficient number, since it is larger than the sum of its proper divisors (10038700269).
30112012131 is a wasteful number, since it uses less digits than its factorization.
30112012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340725.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 30112012131 its reverse (13121021103), we get a palindrome (43233033234).
The spelling of 30112012131 in words is "thirty billion, one hundred twelve million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •