Base | Representation |
---|---|
bin | 10010111101101111010… |
… | …101101110000011011001 |
3 | 11121120220020201201210012 |
4 | 102331233111232003121 |
5 | 132323020210232241 |
6 | 2434411313331305 |
7 | 163104402123224 |
oct | 22755725560331 |
9 | 4546806651705 |
10 | 1303243055321 |
11 | 46277a8026a9 |
12 | 1906b1566b35 |
13 | 95b83c5c39c |
14 | 471121805bb |
15 | 23d789ca6eb |
hex | 12f6f56e0d9 |
1303243055321 has 2 divisors, whose sum is σ = 1303243055322. Its totient is φ = 1303243055320.
The previous prime is 1303243055273. The next prime is 1303243055371. The reversal of 1303243055321 is 1235503423031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1134354933721 + 168888121600 = 1065061^2 + 410960^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303243055321 - 234 = 1286063186137 is a prime.
It is a super-2 number, since 2×13032430553212 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1303243055371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651621527660 + 651621527661.
It is an arithmetic number, because the mean of its divisors is an integer number (651621527661).
Almost surely, 21303243055321 is an apocalyptic number.
It is an amenable number.
1303243055321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303243055321 is an equidigital number, since it uses as much as digits as its factorization.
1303243055321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 1303243055321 its reverse (1235503423031), we get a palindrome (2538746478352).
The spelling of 1303243055321 in words is "one trillion, three hundred three billion, two hundred forty-three million, fifty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •