Base | Representation |
---|---|
bin | 1101101100011000001100… |
… | …01101111101000000011111 |
3 | 10221121200122102022120211110 |
4 | 12312030012031331000133 |
5 | 12421324110212031221 |
6 | 144013152244353103 |
7 | 6225346256061621 |
oct | 666140615750037 |
9 | 127550572276743 |
10 | 30112120033311 |
11 | 965a529812608 |
12 | 3463b200a5793 |
13 | 13a5739c1c624 |
14 | 761611d52c11 |
15 | 373443094776 |
hex | 1b630637d01f |
30112120033311 has 8 divisors (see below), whose sum is σ = 40214355243520. Its totient is φ = 20042315755992.
The previous prime is 30112120033267. The next prime is 30112120033393. The reversal of 30112120033311 is 11333002121103.
Adding to 30112120033311 its reverse (11333002121103), we get a palindrome (41445122154414).
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30112120033311 - 27 = 30112120033183 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 (30112120032311) 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, 8107731055 + ... + 8107734768.
It is an arithmetic number, because the mean of its divisors is an integer number (5026794405440).
Almost surely, 230112120033311 is an apocalyptic number.
30112120033311 is a deficient number, since it is larger than the sum of its proper divisors (10102235210209).
30112120033311 is a wasteful number, since it uses less digits than its factorization.
30112120033311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16215466445.
The product of its (nonzero) digits is 324, while the sum is 21.
The spelling of 30112120033311 in words is "thirty trillion, one hundred twelve billion, one hundred twenty million, thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.052 sec. • engine limits •