Base | Representation |
---|---|
bin | 1001011111101100… |
… | …00011110101000001 |
3 | 111011021011100202000 |
4 | 10233312003311001 |
5 | 40420000333110 |
6 | 2201500414213 |
7 | 240216314361 |
oct | 45766036501 |
9 | 14137140660 |
10 | 5097667905 |
11 | 2186556390 |
12 | ba3247369 |
13 | 633166a55 |
14 | 3650469a1 |
15 | 1ec7ea1c0 |
hex | 12fd83d41 |
5097667905 has 64 divisors (see below), whose sum is σ = 10316298240. Its totient is φ = 2364120000.
The previous prime is 5097667877. The next prime is 5097667919.
5097667905 is a `hidden beast` number, since 509 + 7 + 66 + 79 + 0 + 5 = 666.
5097667905 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5097667905 - 25 = 5097667873 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40471 + ... + 108780.
It is an arithmetic number, because the mean of its divisors is an integer number (161192160).
Almost surely, 25097667905 is an apocalyptic number.
5097667905 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5097667905 is an abundant number, since it is smaller than the sum of its proper divisors (5218630335).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5097667905 is a wasteful number, since it uses less digits than its factorization.
5097667905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149299 (or 149293 counting only the distinct ones).
The product of its (nonzero) digits is 3572100, while the sum is 54.
The square root of 5097667905 is about 71397.9544875062. The cubic root of 5097667905 is about 1721.0382123214.
The spelling of 5097667905 in words is "five billion, ninety-seven million, six hundred sixty-seven thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •