Base | Representation |
---|---|
bin | 101110111110000110101… |
… | …0001100100011101111001 |
3 | 211212010220222022222012022 |
4 | 1131330031101210131321 |
5 | 1321231440442234023 |
6 | 21421350451524225 |
7 | 1234253521226144 |
oct | 135741521443571 |
9 | 24763828288168 |
10 | 6455558555513 |
11 | 2069872565931 |
12 | 8831695b9675 |
13 | 37a9ab214152 |
14 | 184644a1d05b |
15 | b2dcd2107c8 |
hex | 5df0d464779 |
6455558555513 has 2 divisors, whose sum is σ = 6455558555514. Its totient is φ = 6455558555512.
The previous prime is 6455558555491. The next prime is 6455558555531. The reversal of 6455558555513 is 3155558555546.
It is a happy number.
Together with next prime (6455558555531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6396184948624 + 59373606889 = 2529068^2 + 243667^2 .
It is a cyclic number.
It is not a de Polignac number, because 6455558555513 - 26 = 6455558555449 is a prime.
It is a super-2 number, since 2×64555585555132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6455588555513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3227779277756 + 3227779277757.
It is an arithmetic number, because the mean of its divisors is an integer number (3227779277757).
Almost surely, 26455558555513 is an apocalyptic number.
It is an amenable number.
6455558555513 is a deficient number, since it is larger than the sum of its proper divisors (1).
6455558555513 is an equidigital number, since it uses as much as digits as its factorization.
6455558555513 is an evil number, because the sum of its binary digits is even.
The product of its digits is 225000000, while the sum is 62.
The spelling of 6455558555513 in words is "six trillion, four hundred fifty-five billion, five hundred fifty-eight million, five hundred fifty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •