Base | Representation |
---|---|
bin | 10010111101111000111… |
… | …011110000110110110101 |
3 | 11121121022110121202020021 |
4 | 102331320323300312311 |
5 | 132323332412220341 |
6 | 2434435303405141 |
7 | 163111365253336 |
oct | 22757073606665 |
9 | 4547273552207 |
10 | 1303404023221 |
11 | 462852656223 |
12 | 1907374537b1 |
13 | 95bab3cb571 |
14 | 471296c228d |
15 | 23d87bc49d1 |
hex | 12f78ef0db5 |
1303404023221 has 2 divisors, whose sum is σ = 1303404023222. Its totient is φ = 1303404023220.
The previous prime is 1303404023219. The next prime is 1303404023297. The reversal of 1303404023221 is 1223204043031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 871440920100 + 431963103121 = 933510^2 + 657239^2 .
It is an emirp because it is prime and its reverse (1223204043031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1303404023221 - 21 = 1303404023219 is a prime.
Together with 1303404023219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1303404003221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651702011610 + 651702011611.
It is an arithmetic number, because the mean of its divisors is an integer number (651702011611).
Almost surely, 21303404023221 is an apocalyptic number.
It is an amenable number.
1303404023221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303404023221 is an equidigital number, since it uses as much as digits as its factorization.
1303404023221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1303404023221 its reverse (1223204043031), we get a palindrome (2526608066252).
The spelling of 1303404023221 in words is "one trillion, three hundred three billion, four hundred four million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •