Base | Representation |
---|---|
bin | 110011011011000110… |
… | …101000001110101101 |
3 | 12021112001210211202010 |
4 | 303123012220032231 |
5 | 1401040140234001 |
6 | 41210552551433 |
7 | 3663202322631 |
oct | 633306501655 |
9 | 167461724663 |
10 | 55215555501 |
11 | 214648180a7 |
12 | a84b6b2579 |
13 | 528c471042 |
14 | 295b2a2dc1 |
15 | 16826c98d6 |
hex | cdb1a83ad |
55215555501 has 16 divisors (see below), whose sum is σ = 79229268288. Its totient is φ = 34077100800.
The previous prime is 55215555463. The next prime is 55215555509. The reversal of 55215555501 is 10555551255.
It is not a de Polignac number, because 55215555501 - 229 = 54678684589 is a prime.
It is a super-2 number, since 2×552155555012 (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 55215555501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55215555509) 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 in 15 ways as a sum of consecutive naturals, for example, 8871135 + ... + 8877356.
It is an arithmetic number, because the mean of its divisors is an integer number (4951829268).
Almost surely, 255215555501 is an apocalyptic number.
55215555501 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
55215555501 is a deficient number, since it is larger than the sum of its proper divisors (24013712787).
55215555501 is a wasteful number, since it uses less digits than its factorization.
55215555501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17748572.
The product of its (nonzero) digits is 156250, while the sum is 39.
The spelling of 55215555501 in words is "fifty-five billion, two hundred fifteen million, five hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •