Base | Representation |
---|---|
bin | 100110111100111001010… |
… | …0111001100111111001101 |
3 | 200221210012021122201020012 |
4 | 1031321302213030333031 |
5 | 1200202332221132003 |
6 | 15215201510203005 |
7 | 1061526351204113 |
oct | 115716247147715 |
9 | 20853167581205 |
10 | 5353452130253 |
11 | 1784428188417 |
12 | 725650353465 |
13 | 2caa9cc0b5c6 |
14 | 1471738b5ab3 |
15 | 943c78788d8 |
hex | 4de729ccfcd |
5353452130253 has 2 divisors, whose sum is σ = 5353452130254. Its totient is φ = 5353452130252.
The previous prime is 5353452130241. The next prime is 5353452130277. The reversal of 5353452130253 is 3520312543535.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4591536127369 + 761916002884 = 2142787^2 + 872878^2 .
It is a cyclic number.
It is not a de Polignac number, because 5353452130253 - 230 = 5352378388429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5353452130253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5353452130283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2676726065126 + 2676726065127.
It is an arithmetic number, because the mean of its divisors is an integer number (2676726065127).
Almost surely, 25353452130253 is an apocalyptic number.
It is an amenable number.
5353452130253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5353452130253 is an equidigital number, since it uses as much as digits as its factorization.
5353452130253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810000, while the sum is 41.
Adding to 5353452130253 its reverse (3520312543535), we get a palindrome (8873764673788).
The spelling of 5353452130253 in words is "five trillion, three hundred fifty-three billion, four hundred fifty-two million, one hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •