Base | Representation |
---|---|
bin | 1001100001000100… |
… | …10011000010001111 |
3 | 111012001222112022112 |
4 | 10300202103002033 |
5 | 40430432431102 |
6 | 2202553134235 |
7 | 240420013643 |
oct | 46042230217 |
9 | 14161875275 |
10 | 5109264527 |
11 | 2192057074 |
12 | ba70ba37b |
13 | 635697263 |
14 | 3667c4c23 |
15 | 1ed83b252 |
hex | 13089308f |
5109264527 has 2 divisors, whose sum is σ = 5109264528. Its totient is φ = 5109264526.
The previous prime is 5109264509. The next prime is 5109264529. The reversal of 5109264527 is 7254629015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5109264527 - 28 = 5109264271 is a prime.
It is a super-2 number, since 2×51092645272 = 52209168013721067458, which contains 22 as substring.
Together with 5109264529, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5109264529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2554632263 + 2554632264.
It is an arithmetic number, because the mean of its divisors is an integer number (2554632264).
Almost surely, 25109264527 is an apocalyptic number.
5109264527 is a deficient number, since it is larger than the sum of its proper divisors (1).
5109264527 is an equidigital number, since it uses as much as digits as its factorization.
5109264527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 5109264527 is about 71479.1195175206. The cubic root of 5109264527 is about 1722.3422801698.
The spelling of 5109264527 in words is "five billion, one hundred nine million, two hundred sixty-four thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •