Base | Representation |
---|---|
bin | 1001010100010010011… |
… | …11000010010010110101 |
3 | 1010121022102001222112122 |
4 | 10222021033002102311 |
5 | 20221111240000203 |
6 | 403022104525325 |
7 | 32062056050213 |
oct | 4521117022265 |
9 | 1117272058478 |
10 | 320130000053 |
11 | 113848048286 |
12 | 52062a80845 |
13 | 2425a422046 |
14 | 116cc7c7cb3 |
15 | 84d9a58538 |
hex | 4a893c24b5 |
320130000053 has 2 divisors, whose sum is σ = 320130000054. Its totient is φ = 320130000052.
The previous prime is 320129999963. The next prime is 320130000097. The reversal of 320130000053 is 350000031023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 239886407524 + 80243592529 = 489782^2 + 283273^2 .
It is a cyclic number.
It is not a de Polignac number, because 320130000053 - 216 = 320129934517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320129999986 and 320130000040.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320130005053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160065000026 + 160065000027.
It is an arithmetic number, because the mean of its divisors is an integer number (160065000027).
Almost surely, 2320130000053 is an apocalyptic number.
It is an amenable number.
320130000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
320130000053 is an equidigital number, since it uses as much as digits as its factorization.
320130000053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 17.
Adding to 320130000053 its reverse (350000031023), we get a palindrome (670130031076).
The spelling of 320130000053 in words is "three hundred twenty billion, one hundred thirty million, fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •