Base | Representation |
---|---|
bin | 11100000100100110… |
… | …100110101100100111 |
3 | 2212210122111020122002 |
4 | 130010212212230213 |
5 | 443212322444121 |
6 | 21502543355515 |
7 | 2114642525522 |
oct | 340446465447 |
9 | 85718436562 |
10 | 30141999911 |
11 | 11868411731 |
12 | 5a125b2b9b |
13 | 2ac492280a |
14 | 165d24dbb9 |
15 | bb6327e0b |
hex | 7049a6b27 |
30141999911 has 2 divisors, whose sum is σ = 30141999912. Its totient is φ = 30141999910.
The previous prime is 30141999907. The next prime is 30142000001. The reversal of 30141999911 is 11999914103.
It is a weak prime.
It is an emirp because it is prime and its reverse (11999914103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30141999911 - 22 = 30141999907 is a prime.
It is a super-3 number, since 3×301419999113 (a number of 32 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30141992911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15070999955 + 15070999956.
It is an arithmetic number, because the mean of its divisors is an integer number (15070999956).
Almost surely, 230141999911 is an apocalyptic number.
30141999911 is a deficient number, since it is larger than the sum of its proper divisors (1).
30141999911 is an equidigital number, since it uses as much as digits as its factorization.
30141999911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 47.
The spelling of 30141999911 in words is "thirty billion, one hundred forty-one million, nine hundred ninety-nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •