Base | Representation |
---|---|
bin | 1010010000010100… |
… | …00000111010000101 |
3 | 112012200200000112112 |
4 | 11020022000322011 |
5 | 42233410131010 |
6 | 2310151030405 |
7 | 253301264012 |
oct | 51012007205 |
9 | 15180600475 |
10 | 5505552005 |
11 | 2375816788 |
12 | 109796b405 |
13 | 699808aa5 |
14 | 3a32a0709 |
15 | 223519a05 |
hex | 148280e85 |
5505552005 has 16 divisors (see below), whose sum is σ = 6963957120. Its totient is φ = 4166883648.
The previous prime is 5505552001. The next prime is 5505552029. The reversal of 5505552005 is 5002555055.
It is a cyclic number.
It is not a de Polignac number, because 5505552005 - 22 = 5505552001 is a prime.
It is a super-2 number, since 2×55055520052 = 60622205759519040050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5505552001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30104 + ... + 109166.
It is an arithmetic number, because the mean of its divisors is an integer number (435247320).
Almost surely, 25505552005 is an apocalyptic number.
It is an amenable number.
5505552005 is a deficient number, since it is larger than the sum of its proper divisors (1458405115).
5505552005 is a wasteful number, since it uses less digits than its factorization.
5505552005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79820.
The product of its (nonzero) digits is 31250, while the sum is 32.
The square root of 5505552005 is about 74199.4070394097. The cubic root of 5505552005 is about 1765.7679228153.
It can be divided in two parts, 550 and 5552005, that added together give a palindrome (5552555).
The spelling of 5505552005 in words is "five billion, five hundred five million, five hundred fifty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •