Base | Representation |
---|---|
bin | 1001100100110001… |
… | …01010010100101101 |
3 | 111021020100221020212 |
4 | 10302120222110231 |
5 | 41011403333114 |
6 | 2210022152205 |
7 | 241244524463 |
oct | 46230522455 |
9 | 14236327225 |
10 | 5140292909 |
11 | 21a861a164 |
12 | bb5582665 |
13 | 63bc3c34b |
14 | 36a980833 |
15 | 201419b3e |
hex | 13262a52d |
5140292909 has 2 divisors, whose sum is σ = 5140292910. Its totient is φ = 5140292908.
The previous prime is 5140292879. The next prime is 5140292929. The reversal of 5140292909 is 9092920415.
It is a happy number.
5140292909 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2580944809 + 2559348100 = 50803^2 + 50590^2 .
It is a cyclic number.
It is not a de Polignac number, because 5140292909 - 216 = 5140227373 is a prime.
It is a super-2 number, since 2×51402929092 = 52845222380631364562, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5140292929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2570146454 + 2570146455.
It is an arithmetic number, because the mean of its divisors is an integer number (2570146455).
Almost surely, 25140292909 is an apocalyptic number.
It is an amenable number.
5140292909 is a deficient number, since it is larger than the sum of its proper divisors (1).
5140292909 is an equidigital number, since it uses as much as digits as its factorization.
5140292909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 41.
The square root of 5140292909 is about 71695.8360645861. The cubic root of 5140292909 is about 1725.8218204364.
The spelling of 5140292909 in words is "five billion, one hundred forty million, two hundred ninety-two thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •