Base | Representation |
---|---|
bin | 1101111010111100000101… |
… | …00000101110010110010101 |
3 | 11000101112000021212011210211 |
4 | 12331132002200232112111 |
5 | 13003023214403111000 |
6 | 145035052522045421 |
7 | 6306450225504313 |
oct | 675360240562625 |
9 | 130345007764724 |
10 | 30612421535125 |
11 | 983272298a861 |
12 | 3524a86049871 |
13 | 141097b672931 |
14 | 77b91321b0b3 |
15 | 3814753d17ba |
hex | 1bd78282e595 |
30612421535125 has 16 divisors (see below), whose sum is σ = 39436698921984. Its totient is φ = 23699939250000.
The previous prime is 30612421535123. The next prime is 30612421535147. The reversal of 30612421535125 is 52153512421603.
It is not a de Polignac number, because 30612421535125 - 21 = 30612421535123 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30612421535123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3949986001 + ... + 3949993750.
It is an arithmetic number, because the mean of its divisors is an integer number (2464793682624).
Almost surely, 230612421535125 is an apocalyptic number.
It is an amenable number.
30612421535125 is a deficient number, since it is larger than the sum of its proper divisors (8824277386859).
30612421535125 is an equidigital number, since it uses as much as digits as its factorization.
30612421535125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7899979797 (or 7899979787 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 40.
Adding to 30612421535125 its reverse (52153512421603), we get a palindrome (82765933956728).
The spelling of 30612421535125 in words is "thirty trillion, six hundred twelve billion, four hundred twenty-one million, five hundred thirty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •