Base | Representation |
---|---|
bin | 100000110110000… |
… | …101110100111011 |
3 | 1102101220021020211 |
4 | 200312011310323 |
5 | 2112032104210 |
6 | 130402531551 |
7 | 16440565246 |
oct | 4066056473 |
9 | 1371807224 |
10 | 551050555 |
11 | 263065490 |
12 | 134666bb7 |
13 | 8a21a723 |
14 | 5328425d |
15 | 3359e38a |
hex | 20d85d3b |
551050555 has 8 divisors (see below), whose sum is σ = 721375344. Its totient is φ = 400764000.
The previous prime is 551050553. The next prime is 551050561. The reversal of 551050555 is 555050155.
551050555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 551050555 - 21 = 551050553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (551050553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5009496 + ... + 5009605.
It is an arithmetic number, because the mean of its divisors is an integer number (90171918).
Almost surely, 2551050555 is an apocalyptic number.
551050555 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
551050555 is a deficient number, since it is larger than the sum of its proper divisors (170324789).
551050555 is a wasteful number, since it uses less digits than its factorization.
551050555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10019117.
The product of its (nonzero) digits is 15625, while the sum is 31.
The square root of 551050555 is about 23474.4660216159. The cubic root of 551050555 is about 819.8426006635.
It can be divided in two parts, 5510 and 50555, that added together give a palindrome (56065).
The spelling of 551050555 in words is "five hundred fifty-one million, fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •