Base | Representation |
---|---|
bin | 1101101010011011011001… |
… | …00001010110011110010001 |
3 | 10221101021200212010122102002 |
4 | 12311031230201112132101 |
5 | 12414224344412331044 |
6 | 143522311451203345 |
7 | 6220455002020241 |
oct | 665155441263621 |
9 | 127337625118362 |
10 | 30045116917649 |
11 | 9634076253059 |
12 | 3452b40a46555 |
13 | 139c31c638322 |
14 | 75c297371b21 |
15 | 371820b0e74e |
hex | 1b536c856791 |
30045116917649 has 2 divisors, whose sum is σ = 30045116917650. Its totient is φ = 30045116917648.
The previous prime is 30045116917561. The next prime is 30045116917661. The reversal of 30045116917649 is 94671961154003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21348327180625 + 8696789737024 = 4620425^2 + 2949032^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30045116917649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30045116917594 and 30045116917603.
It is not a weakly prime, because it can be changed into another prime (30045116913649) 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, 15022558458824 + 15022558458825.
It is an arithmetic number, because the mean of its divisors is an integer number (15022558458825).
Almost surely, 230045116917649 is an apocalyptic number.
It is an amenable number.
30045116917649 is a deficient number, since it is larger than the sum of its proper divisors (1).
30045116917649 is an equidigital number, since it uses as much as digits as its factorization.
30045116917649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4898880, while the sum is 56.
The spelling of 30045116917649 in words is "thirty trillion, forty-five billion, one hundred sixteen million, nine hundred seventeen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •