Base | Representation |
---|---|
bin | 10011001110100100011… |
… | …001001101010001010101 |
3 | 11200022112120120121202001 |
4 | 103032210121031101111 |
5 | 133122022114000003 |
6 | 2451000335515301 |
7 | 164314240311625 |
oct | 23164431152125 |
9 | 4608476517661 |
10 | 1321313031253 |
11 | 46a40283a006 |
12 | 1940b5088b31 |
13 | 977a3820537 |
14 | 47d47dc4885 |
15 | 245850a761d |
hex | 133a464d455 |
1321313031253 has 2 divisors, whose sum is σ = 1321313031254. Its totient is φ = 1321313031252.
The previous prime is 1321313031211. The next prime is 1321313031287. The reversal of 1321313031253 is 3521303131231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1156222777284 + 165090253969 = 1075278^2 + 406313^2 .
It is a cyclic number.
It is not a de Polignac number, because 1321313031253 - 217 = 1321312900181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1321314031253) 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, 660656515626 + 660656515627.
It is an arithmetic number, because the mean of its divisors is an integer number (660656515627).
Almost surely, 21321313031253 is an apocalyptic number.
It is an amenable number.
1321313031253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321313031253 is an equidigital number, since it uses as much as digits as its factorization.
1321313031253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 1321313031253 its reverse (3521303131231), we get a palindrome (4842616162484).
The spelling of 1321313031253 in words is "one trillion, three hundred twenty-one billion, three hundred thirteen million, thirty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •