Base | Representation |
---|---|
bin | 110011101111101101… |
… | …001111101010111000 |
3 | 12022102011020120012011 |
4 | 303233231033222320 |
5 | 1402242133112330 |
6 | 41305141455304 |
7 | 4004600413264 |
oct | 635755175270 |
9 | 168364216164 |
10 | 55561222840 |
11 | 21621953092 |
12 | a927411534 |
13 | 5315c6b126 |
14 | 29911630a4 |
15 | 16a2c0982a |
hex | cefb4fab8 |
55561222840 has 16 divisors (see below), whose sum is σ = 125012751480. Its totient is φ = 22224489120.
The previous prime is 55561222831. The next prime is 55561222919. The reversal of 55561222840 is 4822216555.
It is a super-2 number, since 2×555612228402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 1389030571 = 55561222840 / (5 + 5 + 5 + 6 + 1 + 2 + 2 + 2 + 8 + 4 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 55561222793 and 55561222802.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 694515246 + ... + 694515325.
Almost surely, 255561222840 is an apocalyptic number.
It is an amenable number.
55561222840 is an abundant number, since it is smaller than the sum of its proper divisors (69451528640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55561222840 is a wasteful number, since it uses less digits than its factorization.
55561222840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389030582 (or 1389030578 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 40.
The spelling of 55561222840 in words is "fifty-five billion, five hundred sixty-one million, two hundred twenty-two thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •