Base | Representation |
---|---|
bin | 1010010000010100… |
… | …00001011010111001 |
3 | 112012200200010102022 |
4 | 11020022001122321 |
5 | 42233410212410 |
6 | 2310151044225 |
7 | 253301303102 |
oct | 51012013271 |
9 | 15180603368 |
10 | 5505554105 |
11 | 2375818317 |
12 | 1097970675 |
13 | 699809a2c |
14 | 3a32a13a9 |
15 | 22351a455 |
hex | 1482816b9 |
5505554105 has 8 divisors (see below), whose sum is σ = 6607291392. Its totient is φ = 4404025648.
The previous prime is 5505554101. The next prime is 5505554111. The reversal of 5505554105 is 5014555055.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5505554105 - 22 = 5505554101 is a prime.
It is a super-2 number, since 2×55055541052 = 60622252006164702050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5505554101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13262 + ... + 105768.
It is an arithmetic number, because the mean of its divisors is an integer number (825911424).
Almost surely, 25505554105 is an apocalyptic number.
It is an amenable number.
5505554105 is a deficient number, since it is larger than the sum of its proper divisors (1101737287).
5505554105 is a wasteful number, since it uses less digits than its factorization.
5505554105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104415.
The product of its (nonzero) digits is 62500, while the sum is 35.
The square root of 5505554105 is about 74199.4211904648. The cubic root of 5505554105 is about 1765.7681473227.
The spelling of 5505554105 in words is "five billion, five hundred five million, five hundred fifty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •