Base | Representation |
---|---|
bin | 111101000010110100… |
… | …000100001111010101 |
3 | 20021011222100002021202 |
4 | 331002310010033111 |
5 | 2033214114021144 |
6 | 50040002322245 |
7 | 4510164112451 |
oct | 750264041725 |
9 | 207158302252 |
10 | 65545454549 |
11 | 25885778153 |
12 | 10853059385 |
13 | 62475c7343 |
14 | 325b17d661 |
15 | 1a8950064e |
hex | f42d043d5 |
65545454549 has 2 divisors, whose sum is σ = 65545454550. Its totient is φ = 65545454548.
The previous prime is 65545454521. The next prime is 65545454567. The reversal of 65545454549 is 94545454556.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62129052049 + 3416402500 = 249257^2 + 58450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-65545454549 is a prime.
It is a super-2 number, since 2×655454545492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 65545454494 and 65545454503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (65545454449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32772727274 + 32772727275.
It is an arithmetic number, because the mean of its divisors is an integer number (32772727275).
Almost surely, 265545454549 is an apocalyptic number.
It is an amenable number.
65545454549 is a deficient number, since it is larger than the sum of its proper divisors (1).
65545454549 is an equidigital number, since it uses as much as digits as its factorization.
65545454549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 43200000, while the sum is 56.
The spelling of 65545454549 in words is "sixty-five billion, five hundred forty-five million, four hundred fifty-four thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •