Base | Representation |
---|---|
bin | 110011110101111011… |
… | …010001000000101001 |
3 | 12022200102120112010012 |
4 | 303311323101000221 |
5 | 1403000340433031 |
6 | 41323350101305 |
7 | 4010305316114 |
oct | 636573210051 |
9 | 168612515105 |
10 | 55665561641 |
11 | 216758383a8 |
12 | a95634a835 |
13 | 5331770771 |
14 | 29a0d6357b |
15 | 16abe69b2b |
hex | cf5ed1029 |
55665561641 has 2 divisors, whose sum is σ = 55665561642. Its totient is φ = 55665561640.
The previous prime is 55665561563. The next prime is 55665561647. The reversal of 55665561641 is 14616556655.
It is a happy number.
55665561641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51042105625 + 4623456016 = 225925^2 + 67996^2 .
It is a cyclic number.
It is not a de Polignac number, because 55665561641 - 230 = 54591819817 is a prime.
It is a super-2 number, since 2×556655616412 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55665561641.
It is not a weakly prime, because it can be changed into another prime (55665561647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27832780820 + 27832780821.
It is an arithmetic number, because the mean of its divisors is an integer number (27832780821).
Almost surely, 255665561641 is an apocalyptic number.
It is an amenable number.
55665561641 is a deficient number, since it is larger than the sum of its proper divisors (1).
55665561641 is an equidigital number, since it uses as much as digits as its factorization.
55665561641 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3240000, while the sum is 50.
The spelling of 55665561641 in words is "fifty-five billion, six hundred sixty-five million, five hundred sixty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •