Base | Representation |
---|---|
bin | 1101110010001100100011… |
… | …10011001011010110001101 |
3 | 10222022210122111210100211010 |
4 | 12321012101303023112031 |
5 | 12433113014230220023 |
6 | 144245053211515433 |
7 | 6245654240346051 |
oct | 671062163132615 |
9 | 128283574710733 |
10 | 30312030320013 |
11 | 9727294978892 |
12 | 3496811758b79 |
13 | 13bb54878a1c0 |
14 | 76b17815dc61 |
15 | 3787436e7093 |
hex | 1b9191ccb58d |
30312030320013 has 8 divisors (see below), whose sum is σ = 43524966613408. Its totient is φ = 18653557119984.
The previous prime is 30312030319943. The next prime is 30312030320027. The reversal of 30312030320013 is 31002303021303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30312030320013 - 232 = 30307735352717 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 (30312030324013) 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, 388615773295 + ... + 388615773372.
It is an arithmetic number, because the mean of its divisors is an integer number (5440620826676).
Almost surely, 230312030320013 is an apocalyptic number.
It is an amenable number.
30312030320013 is a deficient number, since it is larger than the sum of its proper divisors (13212936293395).
30312030320013 is a wasteful number, since it uses less digits than its factorization.
30312030320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777231546683.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30312030320013 its reverse (31002303021303), we get a palindrome (61314333341316).
The spelling of 30312030320013 in words is "thirty trillion, three hundred twelve billion, thirty million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •