Base | Representation |
---|---|
bin | 1001100110011110… |
… | …11010001000100001 |
3 | 111022020101001221202 |
4 | 10303033122020201 |
5 | 41024042111023 |
6 | 2211253530545 |
7 | 241510520054 |
oct | 46317321041 |
9 | 14266331852 |
10 | 5154644513 |
11 | 2205731797 |
12 | bba343a55 |
13 | 641bc5815 |
14 | 36c838a9b |
15 | 202802128 |
hex | 1333da221 |
5154644513 has 2 divisors, whose sum is σ = 5154644514. Its totient is φ = 5154644512.
The previous prime is 5154644459. The next prime is 5154644549. The reversal of 5154644513 is 3154464515.
5154644513 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., 5042136064 + 112508449 = 71008^2 + 10607^2 .
It is a cyclic number.
It is not a de Polignac number, because 5154644513 - 230 = 4080902689 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5154646513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2577322256 + 2577322257.
It is an arithmetic number, because the mean of its divisors is an integer number (2577322257).
Almost surely, 25154644513 is an apocalyptic number.
It is an amenable number.
5154644513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5154644513 is an equidigital number, since it uses as much as digits as its factorization.
5154644513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144000, while the sum is 38.
The square root of 5154644513 is about 71795.8530348376. The cubic root of 5154644513 is about 1727.4264823091.
The spelling of 5154644513 in words is "five billion, one hundred fifty-four million, six hundred forty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •