Base | Representation |
---|---|
bin | 1001010100111110… |
… | …01010101011111001 |
3 | 110221000000121112121 |
4 | 10222133022223321 |
5 | 40223442434401 |
6 | 2144530041241 |
7 | 235045301305 |
oct | 45237125371 |
9 | 13830017477 |
10 | 5007780601 |
11 | 213a84175a |
12 | b79119221 |
13 | 61a6541b5 |
14 | 357128d05 |
15 | 1e4991ca1 |
hex | 12a7caaf9 |
5007780601 has 4 divisors (see below), whose sum is σ = 5008801104. Its totient is φ = 5006760100.
The previous prime is 5007780563. The next prime is 5007780607. The reversal of 5007780601 is 1060877005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1060877005 = 5 ⋅212175401.
It is a cyclic number.
It is not a de Polignac number, because 5007780601 - 217 = 5007649529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5007780607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502855 + ... + 512716.
It is an arithmetic number, because the mean of its divisors is an integer number (1252200276).
Almost surely, 25007780601 is an apocalyptic number.
It is an amenable number.
5007780601 is a deficient number, since it is larger than the sum of its proper divisors (1020503).
5007780601 is a wasteful number, since it uses less digits than its factorization.
5007780601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020502.
The product of its (nonzero) digits is 11760, while the sum is 34.
The square root of 5007780601 is about 70765.6738892523. The cubic root of 5007780601 is about 1710.8624630310.
The spelling of 5007780601 in words is "five billion, seven million, seven hundred eighty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •