Base | Representation |
---|---|
bin | 11100010101001110… |
… | …111100101010101001 |
3 | 2220112002111111001022 |
4 | 130111032330222221 |
5 | 444300234323423 |
6 | 21550351502225 |
7 | 2124601220333 |
oct | 342516745251 |
9 | 86462444038 |
10 | 30421011113 |
11 | 119a095a9a9 |
12 | 5a8bb27975 |
13 | 2b3a6820bc |
14 | 168831c453 |
15 | bd0a8cdc8 |
hex | 7153bcaa9 |
30421011113 has 2 divisors, whose sum is σ = 30421011114. Its totient is φ = 30421011112.
The previous prime is 30421011083. The next prime is 30421011119. The reversal of 30421011113 is 31111012403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27552016144 + 2868994969 = 165988^2 + 53563^2 .
It is an emirp because it is prime and its reverse (31111012403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30421011113 - 28 = 30421010857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30421011091 and 30421011100.
It is not a weakly prime, because it can be changed into another prime (30421011119) 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 as a sum of consecutive naturals, namely, 15210505556 + 15210505557.
It is an arithmetic number, because the mean of its divisors is an integer number (15210505557).
Almost surely, 230421011113 is an apocalyptic number.
It is an amenable number.
30421011113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30421011113 is an equidigital number, since it uses as much as digits as its factorization.
30421011113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30421011113 its reverse (31111012403), we get a palindrome (61532023516).
The spelling of 30421011113 in words is "thirty billion, four hundred twenty-one million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •