Base | Representation |
---|---|
bin | 110011101111000100… |
… | …111011101001001011 |
3 | 12022101102100122220120 |
4 | 303233010323221023 |
5 | 1402231431430201 |
6 | 41304123154323 |
7 | 4004411530353 |
oct | 635704735113 |
9 | 168342318816 |
10 | 55550655051 |
11 | 21616995381 |
12 | a9239759a3 |
13 | 5313a0acb8 |
14 | 298d9b1b63 |
15 | 16a1d1d536 |
hex | cef13ba4b |
55550655051 has 32 divisors (see below), whose sum is σ = 76113354240. Its totient is φ = 36024029184.
The previous prime is 55550655031. The next prime is 55550655073. The reversal of 55550655051 is 15055605555.
It is not a de Polignac number, because 55550655051 - 27 = 55550654923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55550654994 and 55550655012.
It is not an unprimeable number, because it can be changed into a prime (55550655001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11123211 + ... + 11128203.
It is an arithmetic number, because the mean of its divisors is an integer number (2378542320).
Almost surely, 255550655051 is an apocalyptic number.
55550655051 is a deficient number, since it is larger than the sum of its proper divisors (20562699189).
55550655051 is a wasteful number, since it uses less digits than its factorization.
55550655051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5635.
The product of its (nonzero) digits is 468750, while the sum is 42.
The spelling of 55550655051 in words is "fifty-five billion, five hundred fifty million, six hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •