Base | Representation |
---|---|
bin | 10010111100000100101… |
… | …110110000001001010101 |
3 | 11121102021121011102220222 |
4 | 102330010232300021111 |
5 | 132310334320033011 |
6 | 2433514021404125 |
7 | 163012153226153 |
oct | 22740456601125 |
9 | 4542247142828 |
10 | 1301454455381 |
11 | 461a42125033 |
12 | 190292569645 |
13 | 9595a531222 |
14 | 46dc27d43d3 |
15 | 23cc1974ddb |
hex | 12f04bb0255 |
1301454455381 has 2 divisors, whose sum is σ = 1301454455382. Its totient is φ = 1301454455380.
The previous prime is 1301454455359. The next prime is 1301454455407. The reversal of 1301454455381 is 1835544541031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1096766074756 + 204688380625 = 1047266^2 + 452425^2 .
It is an emirp because it is prime and its reverse (1835544541031) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301454455381 is a prime.
It is a super-2 number, since 2×13014544553812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301454455341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650727227690 + 650727227691.
It is an arithmetic number, because the mean of its divisors is an integer number (650727227691).
Almost surely, 21301454455381 is an apocalyptic number.
It is an amenable number.
1301454455381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301454455381 is an equidigital number, since it uses as much as digits as its factorization.
1301454455381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576000, while the sum is 44.
The spelling of 1301454455381 in words is "one trillion, three hundred one billion, four hundred fifty-four million, four hundred fifty-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •