Base | Representation |
---|---|
bin | 1001010100000010… |
… | …11111001000110111 |
3 | 110220110101022122020 |
4 | 10222001133020313 |
5 | 40220000000210 |
6 | 2144051204223 |
7 | 234622204431 |
oct | 45201371067 |
9 | 13813338566 |
10 | 5000000055 |
11 | 2136408056 |
12 | b765a6673 |
13 | 618b5b91b |
14 | 3560a1651 |
15 | 1e3e56770 |
hex | 12a05f237 |
5000000055 has 16 divisors (see below), whose sum is σ = 8275862880. Its totient is φ = 2574712448.
The previous prime is 5000000039. The next prime is 5000000059. The reversal of 5000000055 is 5500000005.
5000000055 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 5000000055 - 24 = 5000000039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
5000000055 is a modest number, since divided by 55 gives 50 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 4999999980 and 5000000043.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5000000059) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5746692 + ... + 5747561.
It is an arithmetic number, because the mean of its divisors is an integer number (517241430).
Almost surely, 25000000055 is an apocalyptic number.
5000000055 is a deficient number, since it is larger than the sum of its proper divisors (3275862825).
5000000055 is a wasteful number, since it uses less digits than its factorization.
5000000055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11494290.
The product of its (nonzero) digits is 125, while the sum is 15.
The square root of 5000000055 is about 70710.6785075635. The cubic root of 5000000055 is about 1709.9759529466.
The spelling of 5000000055 in words is "five billion, fifty-five", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •