Base | Representation |
---|---|
bin | 1001011010000001… |
… | …10010110011100111 |
3 | 111000221202012121000 |
4 | 10231000302303213 |
5 | 40320314300434 |
6 | 2153042124343 |
7 | 236101365510 |
oct | 45500626347 |
9 | 14027665530 |
10 | 5050150119 |
11 | 2161750593 |
12 | b8b3506b3 |
13 | 62636a411 |
14 | 35c9d7a07 |
15 | 1e8560b99 |
hex | 12d032ce7 |
5050150119 has 32 divisors (see below), whose sum is σ = 8553968640. Its totient is φ = 2884635936.
The previous prime is 5050150111. The next prime is 5050150123. The reversal of 5050150119 is 9110510505.
5050150119 is a `hidden beast` number, since 505 + 0 + 150 + 1 + 1 + 9 = 666.
It is not a de Polignac number, because 5050150119 - 23 = 5050150111 is a prime.
It is a super-2 number, since 2×50501501192 = 51008032448871428322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5050150092 and 5050150101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5050150111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 726649 + ... + 733565.
It is an arithmetic number, because the mean of its divisors is an integer number (267311520).
Almost surely, 25050150119 is an apocalyptic number.
5050150119 is a deficient number, since it is larger than the sum of its proper divisors (3503818521).
5050150119 is a wasteful number, since it uses less digits than its factorization.
5050150119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10796 (or 10790 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 27.
The square root of 5050150119 is about 71064.4082435082. The cubic root of 5050150119 is about 1715.6739716321.
The spelling of 5050150119 in words is "five billion, fifty million, one hundred fifty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •