Base | Representation |
---|---|
bin | 11100010011001111… |
… | …000011110110101001 |
3 | 2220102202102020101221 |
4 | 130103033003312221 |
5 | 444213144023441 |
6 | 21543153142041 |
7 | 2124013240666 |
oct | 342317036651 |
9 | 86382366357 |
10 | 30387486121 |
11 | 11983a420a3 |
12 | 5a8085a921 |
13 | 2b33744825 |
14 | 1683ab2a6d |
15 | bccb698d1 |
hex | 7133c3da9 |
30387486121 has 4 divisors (see below), whose sum is σ = 31435330500. Its totient is φ = 29339641744.
The previous prime is 30387486113. The next prime is 30387486137. The reversal of 30387486121 is 12168478303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 12168478303 = 2017 ⋅6032959.
It can be written as a sum of positive squares in 2 ways, for example, as 13926596121 + 16460890000 = 118011^2 + 128300^2 .
It is a cyclic number.
It is not a de Polignac number, because 30387486121 - 23 = 30387486113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30387486161) 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 3 ways as a sum of consecutive naturals, for example, 523922146 + ... + 523922203.
It is an arithmetic number, because the mean of its divisors is an integer number (7858832625).
Almost surely, 230387486121 is an apocalyptic number.
It is an amenable number.
30387486121 is a deficient number, since it is larger than the sum of its proper divisors (1047844379).
30387486121 is a wasteful number, since it uses less digits than its factorization.
30387486121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047844378.
The product of its (nonzero) digits is 193536, while the sum is 43.
The spelling of 30387486121 in words is "thirty billion, three hundred eighty-seven million, four hundred eighty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •