Base | Representation |
---|---|
bin | 1101101001001101001011… |
… | …11010110001101100100111 |
3 | 10221020021022201201221212222 |
4 | 12310212211322301230213 |
5 | 12413032402313223421 |
6 | 143451125302302555 |
7 | 6214440351632141 |
oct | 664464572615447 |
9 | 127207281657788 |
10 | 30003130211111 |
11 | 961828a907a92 |
12 | 3446983727a5b |
13 | 139838aab4385 |
14 | 75a232da9c91 |
15 | 3706b49ddcab |
hex | 1b49a5eb1b27 |
30003130211111 has 4 divisors (see below), whose sum is σ = 30268644637872. Its totient is φ = 29737615784352.
The previous prime is 30003130211071. The next prime is 30003130211113. The reversal of 30003130211111 is 11111203130003.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30003130211111 - 222 = 30003126016807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30003130211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30003130211113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 132757213211 + ... + 132757213436.
It is an arithmetic number, because the mean of its divisors is an integer number (7567161159468).
Almost surely, 230003130211111 is an apocalyptic number.
30003130211111 is a deficient number, since it is larger than the sum of its proper divisors (265514426761).
30003130211111 is a wasteful number, since it uses less digits than its factorization.
30003130211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265514426760.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 30003130211111 its reverse (11111203130003), we get a palindrome (41114333341114).
The spelling of 30003130211111 in words is "thirty trillion, three billion, one hundred thirty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •