Base | Representation |
---|---|
bin | 1101101100111010000110… |
… | …10000101000001110111101 |
3 | 10221200102122002022121202221 |
4 | 12312131003100220032331 |
5 | 12422123400421422023 |
6 | 144025402455045341 |
7 | 6226562342260636 |
oct | 666350320501675 |
9 | 127612562277687 |
10 | 30130324014013 |
11 | 9667220456763 |
12 | 3467560670851 |
13 | 13a737b49c042 |
14 | 76245b8ba88d |
15 | 373b5b2e185d |
hex | 1b67434283bd |
30130324014013 has 8 divisors (see below), whose sum is σ = 30474609987200. Its totient is φ = 29787966814320.
The previous prime is 30130324013971. The next prime is 30130324014061. The reversal of 30130324014013 is 31041042303103.
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 30130324014013 - 29 = 30130324013501 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 (30130324014113) 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 7 ways as a sum of consecutive naturals, for example, 482161953 + ... + 482224438.
It is an arithmetic number, because the mean of its divisors is an integer number (3809326248400).
Almost surely, 230130324014013 is an apocalyptic number.
It is an amenable number.
30130324014013 is a deficient number, since it is larger than the sum of its proper divisors (344285973187).
30130324014013 is a wasteful number, since it uses less digits than its factorization.
30130324014013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 964386747.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 30130324014013 its reverse (31041042303103), we get a palindrome (61171366317116).
The spelling of 30130324014013 in words is "thirty trillion, one hundred thirty billion, three hundred twenty-four million, fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •