Base | Representation |
---|---|
bin | 1101110101010110001000… |
… | …11000110101100000000001 |
3 | 10222201010222202022002010012 |
4 | 12322223010120311200001 |
5 | 12441401134312011301 |
6 | 144410512120314305 |
7 | 6256535143062164 |
oct | 672530430654001 |
9 | 128633882262105 |
10 | 30420253235201 |
11 | 976917a995865 |
12 | 34b3795312995 |
13 | 13c8804a5b31b |
14 | 7724c3313adb |
15 | 37b4797b0ebb |
hex | 1baac4635801 |
30420253235201 has 2 divisors, whose sum is σ = 30420253235202. Its totient is φ = 30420253235200.
The previous prime is 30420253235129. The next prime is 30420253235219. The reversal of 30420253235201 is 10253235202403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23936996577025 + 6483256658176 = 4892545^2 + 2546224^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30420253235201 is a prime.
It is not a weakly prime, because it can be changed into another prime (30420253235101) 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, 15210126617600 + 15210126617601.
It is an arithmetic number, because the mean of its divisors is an integer number (15210126617601).
Almost surely, 230420253235201 is an apocalyptic number.
It is an amenable number.
30420253235201 is a deficient number, since it is larger than the sum of its proper divisors (1).
30420253235201 is an equidigital number, since it uses as much as digits as its factorization.
30420253235201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 30420253235201 its reverse (10253235202403), we get a palindrome (40673488437604).
The spelling of 30420253235201 in words is "thirty trillion, four hundred twenty billion, two hundred fifty-three million, two hundred thirty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •