Base | Representation |
---|---|
bin | 1101111011110101100110… |
… | …10010100100110110010101 |
3 | 11000111110201120221112100222 |
4 | 12331322303102210312111 |
5 | 13004024441444241403 |
6 | 145101201223044125 |
7 | 6311622441064124 |
oct | 675726322446625 |
9 | 130443646845328 |
10 | 30643304680853 |
11 | 9844830694297 |
12 | 352aa648a0645 |
13 | 14138609aca67 |
14 | 77d202a75abb |
15 | 382181808338 |
hex | 1bdeb34a4d95 |
30643304680853 has 2 divisors, whose sum is σ = 30643304680854. Its totient is φ = 30643304680852.
The previous prime is 30643304680829. The next prime is 30643304680951. The reversal of 30643304680853 is 35808640334603.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23159261133649 + 7484043547204 = 4812407^2 + 2735698^2 .
It is a cyclic number.
It is not a de Polignac number, because 30643304680853 - 224 = 30643287903637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30643304680795 and 30643304680804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30643304680753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15321652340426 + 15321652340427.
It is an arithmetic number, because the mean of its divisors is an integer number (15321652340427).
Almost surely, 230643304680853 is an apocalyptic number.
It is an amenable number.
30643304680853 is a deficient number, since it is larger than the sum of its proper divisors (1).
30643304680853 is an equidigital number, since it uses as much as digits as its factorization.
30643304680853 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14929920, while the sum is 53.
The spelling of 30643304680853 in words is "thirty trillion, six hundred forty-three billion, three hundred four million, six hundred eighty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •