Base | Representation |
---|---|
bin | 10010111100000100101… |
… | …110110000001011111101 |
3 | 11121102021121011110011012 |
4 | 102330010232300023331 |
5 | 132310334320034144 |
6 | 2433514021405005 |
7 | 163012153226513 |
oct | 22740456601375 |
9 | 4542247143135 |
10 | 1301454455549 |
11 | 461a42125176 |
12 | 190292569765 |
13 | 9595a531321 |
14 | 46dc27d44b3 |
15 | 23cc1974e9e |
hex | 12f04bb02fd |
1301454455549 has 2 divisors, whose sum is σ = 1301454455550. Its totient is φ = 1301454455548.
The previous prime is 1301454455527. The next prime is 1301454455551. The reversal of 1301454455549 is 9455544541031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1231278736900 + 70175718649 = 1109630^2 + 264907^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301454455549 is a prime.
Together with 1301454455551, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301454455497 and 1301454455506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301454455849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650727227774 + 650727227775.
It is an arithmetic number, because the mean of its divisors is an integer number (650727227775).
Almost surely, 21301454455549 is an apocalyptic number.
It is an amenable number.
1301454455549 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301454455549 is an equidigital number, since it uses as much as digits as its factorization.
1301454455549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320000, while the sum is 50.
The spelling of 1301454455549 in words is "one trillion, three hundred one billion, four hundred fifty-four million, four hundred fifty-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •