Base | Representation |
---|---|
bin | 1001110100010100… |
… | …00000101010101001 |
3 | 111121022200202222202 |
4 | 10322022000222221 |
5 | 41243242414433 |
6 | 2231000425545 |
7 | 244416645551 |
oct | 47212005251 |
9 | 14538622882 |
10 | 5270669993 |
11 | 2265179416 |
12 | 10311782b5 |
13 | 65cc5a654 |
14 | 37dddc161 |
15 | 20cabeee8 |
hex | 13a280aa9 |
5270669993 has 2 divisors, whose sum is σ = 5270669994. Its totient is φ = 5270669992.
The previous prime is 5270669983. The next prime is 5270670023. The reversal of 5270669993 is 3999660725.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3155405929 + 2115264064 = 56173^2 + 45992^2 .
It is a cyclic number.
It is not a de Polignac number, because 5270669993 - 28 = 5270669737 is a prime.
It is a super-2 number, since 2×52706699932 = 55559924350221240098, which contains 22 as substring.
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 (5270669983) 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, 2635334996 + 2635334997.
It is an arithmetic number, because the mean of its divisors is an integer number (2635334997).
Almost surely, 25270669993 is an apocalyptic number.
It is an amenable number.
5270669993 is a deficient number, since it is larger than the sum of its proper divisors (1).
5270669993 is an equidigital number, since it uses as much as digits as its factorization.
5270669993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5511240, while the sum is 56.
The square root of 5270669993 is about 72599.3801144335. The cubic root of 5270669993 is about 1740.2912703262.
The spelling of 5270669993 in words is "five billion, two hundred seventy million, six hundred sixty-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •