Base | Representation |
---|---|
bin | 100000110010011… |
… | …101110010001001 |
3 | 1102100002222110222 |
4 | 200302131302021 |
5 | 2111311200410 |
6 | 130330315425 |
7 | 16426526252 |
oct | 4062356211 |
9 | 1370088428 |
10 | 550100105 |
11 | 262576395 |
12 | 134288b75 |
13 | 89c76c29 |
14 | 530b7b29 |
15 | 33462955 |
hex | 20c9dc89 |
550100105 has 8 divisors (see below), whose sum is σ = 661105032. Its totient is φ = 439423488.
The previous prime is 550100081. The next prime is 550100107. The reversal of 550100105 is 501001055.
It can be written as a sum of positive squares in 4 ways, for example, as 11999296 + 538100809 = 3464^2 + 23197^2 .
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 550100105 - 212 = 550096009 is a prime.
It is a super-2 number, since 2×5501001052 = 605220251042022050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550100107) 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, 78374 + ... + 85103.
It is an arithmetic number, because the mean of its divisors is an integer number (82638129).
Almost surely, 2550100105 is an apocalyptic number.
It is an amenable number.
550100105 is a deficient number, since it is larger than the sum of its proper divisors (111004927).
550100105 is a wasteful number, since it uses less digits than its factorization.
550100105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164155.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 550100105 is about 23454.2129477840. The cubic root of 550100105 is about 819.3709755584.
The spelling of 550100105 in words is "five hundred fifty million, one hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •