Base | Representation |
---|---|
bin | 10011000100011101001… |
… | …111000100000010100101 |
3 | 11122021111220020120001202 |
4 | 103010131033010002211 |
5 | 132432303102411003 |
6 | 2442003121332245 |
7 | 163451211034325 |
oct | 23043517040245 |
9 | 4567456216052 |
10 | 1310455513253 |
11 | 465840a79037 |
12 | 191b84a97085 |
13 | 96763291b83 |
14 | 475d8003285 |
15 | 2414bcb0088 |
hex | 1311d3c40a5 |
1310455513253 has 2 divisors, whose sum is σ = 1310455513254. Its totient is φ = 1310455513252.
The previous prime is 1310455513229. The next prime is 1310455513277. The reversal of 1310455513253 is 3523155540131.
It is a balanced prime because it is at equal distance from previous prime (1310455513229) and next prime (1310455513277).
It can be written as a sum of positive squares in only one way, i.e., 670764276004 + 639691237249 = 819002^2 + 799807^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310455513253 - 28 = 1310455512997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310455513223) 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, 655227756626 + 655227756627.
It is an arithmetic number, because the mean of its divisors is an integer number (655227756627).
Almost surely, 21310455513253 is an apocalyptic number.
It is an amenable number.
1310455513253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310455513253 is an equidigital number, since it uses as much as digits as its factorization.
1310455513253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 38.
The spelling of 1310455513253 in words is "one trillion, three hundred ten billion, four hundred fifty-five million, five hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •