Base | Representation |
---|---|
bin | 101000010100101… |
… | …1111001101011101 |
3 | 10111022000012210212 |
4 | 1100221133031131 |
5 | 10232340144041 |
6 | 342132342205 |
7 | 45346521665 |
oct | 12051371535 |
9 | 3438005725 |
10 | 1353053021 |
11 | 634843841 |
12 | 319174965 |
13 | 187421bb8 |
14 | cb9b11a5 |
15 | 7dbbe8eb |
hex | 50a5f35d |
1353053021 has 2 divisors, whose sum is σ = 1353053022. Its totient is φ = 1353053020.
The previous prime is 1353052949. The next prime is 1353053071. The reversal of 1353053021 is 1203503531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 800097796 + 552955225 = 28286^2 + 23515^2 .
It is an emirp because it is prime and its reverse (1203503531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1353053021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1353053071) 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, 676526510 + 676526511.
It is an arithmetic number, because the mean of its divisors is an integer number (676526511).
Almost surely, 21353053021 is an apocalyptic number.
It is an amenable number.
1353053021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1353053021 is an equidigital number, since it uses as much as digits as its factorization.
1353053021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 1353053021 is about 36783.8690324985. The cubic root of 1353053021 is about 1106.0419649620.
Adding to 1353053021 its reverse (1203503531), we get a palindrome (2556556552).
The spelling of 1353053021 in words is "one billion, three hundred fifty-three million, fifty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •