Base | Representation |
---|---|
bin | 1001100101111111… |
… | …01000111110011101 |
3 | 111021221121001211212 |
4 | 10302333220332131 |
5 | 41022012323010 |
6 | 2211025154205 |
7 | 241430423033 |
oct | 46277507635 |
9 | 14257531755 |
10 | 5150511005 |
11 | 2203369172 |
12 | bb8a8b965 |
13 | 6410a9263 |
14 | 36c080553 |
15 | 202287505 |
hex | 132fe8f9d |
5150511005 has 8 divisors (see below), whose sum is σ = 6181012824. Its totient is φ = 4120142400.
The previous prime is 5150510999. The next prime is 5150511011. The reversal of 5150511005 is 5001150515.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5150510999) and next prime (5150511011).
It can be written as a sum of positive squares in 4 ways, for example, as 636149284 + 4514361721 = 25222^2 + 67189^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5150511005 - 222 = 5146316701 is a prime.
It is a super-2 number, since 2×51505110052 = 53055527225252220050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101015 + ... + 143195.
It is an arithmetic number, because the mean of its divisors is an integer number (772626603).
Almost surely, 25150511005 is an apocalyptic number.
It is an amenable number.
5150511005 is a deficient number, since it is larger than the sum of its proper divisors (1030501819).
5150511005 is a wasteful number, since it uses less digits than its factorization.
5150511005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66607.
The product of its (nonzero) digits is 625, while the sum is 23.
The square root of 5150511005 is about 71767.0607242626. The cubic root of 5150511005 is about 1726.9646178924.
The spelling of 5150511005 in words is "five billion, one hundred fifty million, five hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •