Base | Representation |
---|---|
bin | 1101111000010111110100… |
… | …10000100100001011001101 |
3 | 11000002002101111200122001011 |
4 | 12330023322100210023031 |
5 | 13000102113440024403 |
6 | 144530350205245221 |
7 | 6300206013121141 |
oct | 674137220441315 |
9 | 130062344618034 |
10 | 30524236251853 |
11 | 97a928a665263 |
12 | 350b974b63811 |
13 | 14055667c4146 |
14 | 777549347221 |
15 | 37e013518a6d |
hex | 1bc2fa4242cd |
30524236251853 has 2 divisors, whose sum is σ = 30524236251854. Its totient is φ = 30524236251852.
The previous prime is 30524236251851. The next prime is 30524236251857. The reversal of 30524236251853 is 35815263242503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29460611184169 + 1063625067684 = 5427763^2 + 1031322^2 .
It is a cyclic number.
It is not a de Polignac number, because 30524236251853 - 21 = 30524236251851 is a prime.
Together with 30524236251851, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 30524236251797 and 30524236251806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30524236251851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15262118125926 + 15262118125927.
It is an arithmetic number, because the mean of its divisors is an integer number (15262118125927).
Almost surely, 230524236251853 is an apocalyptic number.
It is an amenable number.
30524236251853 is a deficient number, since it is larger than the sum of its proper divisors (1).
30524236251853 is an equidigital number, since it uses as much as digits as its factorization.
30524236251853 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184000, while the sum is 49.
The spelling of 30524236251853 in words is "thirty trillion, five hundred twenty-four billion, two hundred thirty-six million, two hundred fifty-one thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •