Base | Representation |
---|---|
bin | 10010111110101111100… |
… | …010110101001100001101 |
3 | 11121200200022122002111012 |
4 | 102332233202311030031 |
5 | 132332221434444003 |
6 | 2435110233135005 |
7 | 163143162030461 |
oct | 22765742651415 |
9 | 4550608562435 |
10 | 1304320234253 |
11 | 463182850123 |
12 | 19095225a465 |
13 | 95cc617c87a |
14 | 471b525c4a1 |
15 | 23ddd3548d8 |
hex | 12faf8b530d |
1304320234253 has 2 divisors, whose sum is σ = 1304320234254. Its totient is φ = 1304320234252.
The previous prime is 1304320234219. The next prime is 1304320234267. The reversal of 1304320234253 is 3524320234031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 823922920804 + 480397313449 = 907702^2 + 693107^2 .
It is a cyclic number.
It is not a de Polignac number, because 1304320234253 - 216 = 1304320168717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1304320234213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 652160117126 + 652160117127.
It is an arithmetic number, because the mean of its divisors is an integer number (652160117127).
Almost surely, 21304320234253 is an apocalyptic number.
It is an amenable number.
1304320234253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304320234253 is an equidigital number, since it uses as much as digits as its factorization.
1304320234253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 1304320234253 its reverse (3524320234031), we get a palindrome (4828640468284).
The spelling of 1304320234253 in words is "one trillion, three hundred four billion, three hundred twenty million, two hundred thirty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •