Base | Representation |
---|---|
bin | 1001011010101010… |
… | …01101000011001001 |
3 | 111001022211000220212 |
4 | 10231111031003021 |
5 | 40323202003424 |
6 | 2153352530505 |
7 | 236165021324 |
oct | 45525150311 |
9 | 14038730825 |
10 | 5055500489 |
11 | 2164775386 |
12 | b910b0a35 |
13 | 6274c1810 |
14 | 35d5cb7bb |
15 | 1e8c6b10e |
hex | 12d54d0c9 |
5055500489 has 8 divisors (see below), whose sum is σ = 5455088520. Its totient is φ = 4657441536.
The previous prime is 5055500459. The next prime is 5055500501. The reversal of 5055500489 is 9840055505.
5055500489 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1428025 + 5054072464 = 1195^2 + 71092^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 5055500489 - 216 = 5055434953 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5055500459) 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, 375392 + ... + 388625.
It is an arithmetic number, because the mean of its divisors is an integer number (681886065).
Almost surely, 25055500489 is an apocalyptic number.
It is an amenable number.
5055500489 is a deficient number, since it is larger than the sum of its proper divisors (399588031).
5055500489 is a wasteful number, since it uses less digits than its factorization.
5055500489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764539.
The product of its (nonzero) digits is 180000, while the sum is 41.
The square root of 5055500489 is about 71102.0427906259. The cubic root of 5055500489 is about 1716.2796467446.
The spelling of 5055500489 in words is "five billion, fifty-five million, five hundred thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •