Base | Representation |
---|---|
bin | 1101101001011110010001… |
… | …00000000000100100101111 |
3 | 10221021010222210221022221110 |
4 | 12310233020200000210233 |
5 | 12413210142341100221 |
6 | 143455243242003103 |
7 | 6215213531442354 |
oct | 664571040004457 |
9 | 127233883838843 |
10 | 30012300331311 |
11 | 9621166133021 |
12 | 34487027a6493 |
13 | 13991bc8895bc |
14 | 75a862c2662b |
15 | 370a4eac1776 |
hex | 1b4bc880092f |
30012300331311 has 8 divisors (see below), whose sum is σ = 40102088667264. Its totient is φ = 19965356108120.
The previous prime is 30012300331283. The next prime is 30012300331331. The reversal of 30012300331311 is 11313300321003.
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 30012300331311 - 233 = 30003710396719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30012300331331) 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, 10711026555 + ... + 10711029356.
It is an arithmetic number, because the mean of its divisors is an integer number (5012761083408).
Almost surely, 230012300331311 is an apocalyptic number.
30012300331311 is a deficient number, since it is larger than the sum of its proper divisors (10089788335953).
30012300331311 is a wasteful number, since it uses less digits than its factorization.
30012300331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21422056381.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 30012300331311 its reverse (11313300321003), we get a palindrome (41325600652314).
The spelling of 30012300331311 in words is "thirty trillion, twelve billion, three hundred million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •