Base | Representation |
---|---|
bin | 1001011111011110… |
… | …00101101110111001 |
3 | 111011010201112021122 |
4 | 10233233011232321 |
5 | 40414013400242 |
6 | 2201353315025 |
7 | 240164634263 |
oct | 45757055671 |
9 | 14133645248 |
10 | 5095840697 |
11 | 21855185a2 |
12 | ba2705a75 |
13 | 63297716c |
14 | 364accb33 |
15 | 1ec588ad2 |
hex | 12fbc5bb9 |
5095840697 has 4 divisors (see below), whose sum is σ = 5098656336. Its totient is φ = 5093025060.
The previous prime is 5095840691. The next prime is 5095840703. The reversal of 5095840697 is 7960485905.
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.
It is an interprime number because it is at equal distance from previous prime (5095840691) and next prime (5095840703).
It is a cyclic number.
It is not a de Polignac number, because 5095840697 - 210 = 5095839673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5095840691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1405103 + ... + 1408724.
It is an arithmetic number, because the mean of its divisors is an integer number (1274664084).
Almost surely, 25095840697 is an apocalyptic number.
It is an amenable number.
5095840697 is a deficient number, since it is larger than the sum of its proper divisors (2815639).
5095840697 is a wasteful number, since it uses less digits than its factorization.
5095840697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2815638.
The product of its (nonzero) digits is 2721600, while the sum is 53.
The square root of 5095840697 is about 71385.1573998405. The cubic root of 5095840697 is about 1720.8325581117.
The spelling of 5095840697 in words is "five billion, ninety-five million, eight hundred forty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •