Base | Representation |
---|---|
bin | 110100000011000101… |
… | …011101010110111101 |
3 | 12100020211000002121201 |
4 | 310003011131112331 |
5 | 1403423400244334 |
6 | 41401314055501 |
7 | 4015626013324 |
oct | 640305352675 |
9 | 170224002551 |
10 | 55886337469 |
11 | 21779420566 |
12 | a9b827a591 |
13 | 5368420351 |
14 | 29c23d30bb |
15 | 16c1529c14 |
hex | d0315d5bd |
55886337469 has 2 divisors, whose sum is σ = 55886337470. Its totient is φ = 55886337468.
The previous prime is 55886337443. The next prime is 55886337509. The reversal of 55886337469 is 96473368855.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49980414969 + 5905922500 = 223563^2 + 76850^2 .
It is a cyclic number.
It is not a de Polignac number, because 55886337469 - 213 = 55886329277 is a prime.
It is a super-2 number, since 2×558863374692 (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 55886337469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55886331469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27943168734 + 27943168735.
It is an arithmetic number, because the mean of its divisors is an integer number (27943168735).
Almost surely, 255886337469 is an apocalyptic number.
It is an amenable number.
55886337469 is a deficient number, since it is larger than the sum of its proper divisors (1).
55886337469 is an equidigital number, since it uses as much as digits as its factorization.
55886337469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 130636800, while the sum is 64.
The spelling of 55886337469 in words is "fifty-five billion, eight hundred eighty-six million, three hundred thirty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •