Base | Representation |
---|---|
bin | 1101101100111001101110… |
… | …00111100010001000000111 |
3 | 10221200102002220000000221201 |
4 | 12312130313013202020013 |
5 | 12422122441244144421 |
6 | 144025330340523331 |
7 | 6226554316616413 |
oct | 666346707421007 |
9 | 127612086000851 |
10 | 30130120303111 |
11 | 9667126469744 |
12 | 34675043b0547 |
13 | 13a734821594a |
14 | 76243c80dd43 |
15 | 373b484a2b91 |
hex | 1b67371e2207 |
30130120303111 has 8 divisors (see below), whose sum is σ = 30255313725648. Its totient is φ = 30004928304000.
The previous prime is 30130120303097. The next prime is 30130120303187. The reversal of 30130120303111 is 11130302103103.
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 30130120303111 - 223 = 30130111914503 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 (30130120303711) 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, 76117896 + ... + 76512706.
It is an arithmetic number, because the mean of its divisors is an integer number (3781914215706).
Almost surely, 230130120303111 is an apocalyptic number.
30130120303111 is a deficient number, since it is larger than the sum of its proper divisors (125193422537).
30130120303111 is a wasteful number, since it uses less digits than its factorization.
30130120303111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711713.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30130120303111 its reverse (11130302103103), we get a palindrome (41260422406214).
The spelling of 30130120303111 in words is "thirty trillion, one hundred thirty billion, one hundred twenty million, three hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •