Base | Representation |
---|---|
bin | 1101101001000111100100… |
… | …00101111101101000101001 |
3 | 10221012222112110210012000202 |
4 | 12310203302011331220221 |
5 | 12413010212442312323 |
6 | 143445510050241545 |
7 | 6214302526063553 |
oct | 664436205755051 |
9 | 127188473705022 |
10 | 30000113244713 |
11 | 9616a81909527 |
12 | 34462812862b5 |
13 | 1397cc9a3c461 |
14 | 75a0284284d3 |
15 | 370589be7d28 |
hex | 1b48f217da29 |
30000113244713 has 2 divisors, whose sum is σ = 30000113244714. Its totient is φ = 30000113244712.
The previous prime is 30000113244701. The next prime is 30000113244721. The reversal of 30000113244713 is 31744231100003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17631365856784 + 12368747387929 = 4198972^2 + 3516923^2 .
It is a cyclic number.
It is not a de Polignac number, because 30000113244713 - 24 = 30000113244697 is a prime.
It is not a weakly prime, because it can be changed into another prime (30000113274713) 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 as a sum of consecutive naturals, namely, 15000056622356 + 15000056622357.
It is an arithmetic number, because the mean of its divisors is an integer number (15000056622357).
Almost surely, 230000113244713 is an apocalyptic number.
It is an amenable number.
30000113244713 is a deficient number, since it is larger than the sum of its proper divisors (1).
30000113244713 is an equidigital number, since it uses as much as digits as its factorization.
30000113244713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 30000113244713 its reverse (31744231100003), we get a palindrome (61744344344716).
The spelling of 30000113244713 in words is "thirty trillion, one hundred thirteen million, two hundred forty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •