Base | Representation |
---|---|
bin | 1001010100110100… |
… | …10011011000011101 |
3 | 110220220121211102200 |
4 | 10222122103120131 |
5 | 40223131134001 |
6 | 2144442442113 |
7 | 235031410644 |
oct | 45232233035 |
9 | 13826554380 |
10 | 5006505501 |
11 | 213a050758 |
12 | b78803339 |
13 | 61a2c89ba |
14 | 356cb635b |
15 | 1e47de086 |
hex | 12a69361d |
5006505501 has 12 divisors (see below), whose sum is σ = 7242909180. Its totient is φ = 3332459520.
The previous prime is 5006505463. The next prime is 5006505527. The reversal of 5006505501 is 1055056005.
5006505501 is a `hidden beast` number, since 5 + 0 + 0 + 650 + 5 + 5 + 0 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3268866276 + 1737639225 = 57174^2 + 41685^2 .
It is not a de Polignac number, because 5006505501 - 29 = 5006504989 is a prime.
It is a super-2 number, since 2×50065055012 = 50130194663086522002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5006505541) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 428146 + ... + 439683.
It is an arithmetic number, because the mean of its divisors is an integer number (603575765).
Almost surely, 25006505501 is an apocalyptic number.
It is an amenable number.
5006505501 is a deficient number, since it is larger than the sum of its proper divisors (2236403679).
5006505501 is a wasteful number, since it uses less digits than its factorization.
5006505501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868476 (or 868473 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 5006505501 is about 70756.6640041770. The cubic root of 5006505501 is about 1710.7172419519.
The spelling of 5006505501 in words is "five billion, six million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •