Base | Representation |
---|---|
bin | 110011101100010110… |
… | …110001011001111101 |
3 | 12022021020110011001000 |
4 | 303230112301121331 |
5 | 1402133240000221 |
6 | 41255412440513 |
7 | 4003315500420 |
oct | 635426613175 |
9 | 168236404030 |
10 | 55505000061 |
11 | 215a3142085 |
12 | a910619139 |
13 | 5307414504 |
14 | 29878c99b7 |
15 | 169cd00e26 |
hex | cec5b167d |
55505000061 has 16 divisors (see below), whose sum is σ = 93976720000. Its totient is φ = 31717142784.
The previous prime is 55505000041. The next prime is 55505000087. The reversal of 55505000061 is 16000050555.
55505000061 is a `hidden beast` number, since 5 + 550 + 50 + 0 + 0 + 0 + 61 = 666.
It is not a de Polignac number, because 55505000061 - 27 = 55504999933 is a prime.
It is a super-2 number, since 2×555050000612 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55504999989 and 55505000034.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55505000041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 146838436 + ... + 146838813.
It is an arithmetic number, because the mean of its divisors is an integer number (5873545000).
Almost surely, 255505000061 is an apocalyptic number.
It is an amenable number.
55505000061 is a deficient number, since it is larger than the sum of its proper divisors (38471719939).
55505000061 is a wasteful number, since it uses less digits than its factorization.
55505000061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293677265 (or 293677259 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 55505000061 in words is "fifty-five billion, five hundred five million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •