Base | Representation |
---|---|
bin | 100000110010010… |
… | …001101011001001 |
3 | 1102100000110102221 |
4 | 200302101223021 |
5 | 2111303104010 |
6 | 130325254041 |
7 | 16426231534 |
oct | 4062215311 |
9 | 1370013387 |
10 | 550050505 |
11 | 2625420a4 |
12 | 134264321 |
13 | 89c5a494 |
14 | 530a3a1b |
15 | 33452dda |
hex | 20c91ac9 |
550050505 has 4 divisors (see below), whose sum is σ = 660060612. Its totient is φ = 440040400.
The previous prime is 550050499. The next prime is 550050517. The reversal of 550050505 is 505050055.
550050505 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 74287161 + 475763344 = 8619^2 + 21812^2 .
It is not a de Polignac number, because 550050505 - 213 = 550042313 is a prime.
It is a Duffinian number.
550050505 is a modest number, since divided by 50505 gives 550 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 550050505.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55005046 + ... + 55005055.
It is an arithmetic number, because the mean of its divisors is an integer number (165015153).
Almost surely, 2550050505 is an apocalyptic number.
It is an amenable number.
550050505 is a deficient number, since it is larger than the sum of its proper divisors (110010107).
550050505 is a wasteful number, since it uses less digits than its factorization.
550050505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110010106.
The product of its (nonzero) digits is 3125, while the sum is 25.
The square root of 550050505 is about 23453.1555446170. The cubic root of 550050505 is about 819.3463485123.
The spelling of 550050505 in words is "five hundred fifty million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •