Base | Representation |
---|---|
bin | 11100000011011110… |
… | …100011101010101011 |
3 | 2212202022221200211201 |
4 | 130003132203222223 |
5 | 443143004110011 |
6 | 21501030505031 |
7 | 2114323144156 |
oct | 340336435253 |
9 | 85668850751 |
10 | 30123113131 |
11 | 11858791821 |
12 | 5a08205177 |
13 | 2ac0a3bcc7 |
14 | 165a934c9d |
15 | bb4846cc1 |
hex | 7037a3aab |
30123113131 has 8 divisors (see below), whose sum is σ = 31164943680. Its totient is φ = 29081489472.
The previous prime is 30123113113. The next prime is 30123113143. The reversal of 30123113131 is 13131132103.
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 30123113131 - 25 = 30123113099 is a prime.
It is a super-2 number, since 2×301231131312 (a number of 22 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 = 30123113099 and 30123113108.
It is not an unprimeable number, because it can be changed into a prime (30123143131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 280846 + ... + 372988.
It is an arithmetic number, because the mean of its divisors is an integer number (3895617960).
Almost surely, 230123113131 is an apocalyptic number.
30123113131 is a deficient number, since it is larger than the sum of its proper divisors (1041830549).
30123113131 is a wasteful number, since it uses less digits than its factorization.
30123113131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103445.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30123113131 its reverse (13131132103), we get a palindrome (43254245234).
The spelling of 30123113131 in words is "thirty billion, one hundred twenty-three million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •