Base | Representation |
---|---|
bin | 1010100011011100… |
… | …11010111000101001 |
3 | 112121212202020000002 |
4 | 11101232122320221 |
5 | 43101004344122 |
6 | 2334123552345 |
7 | 260260655252 |
oct | 52156327051 |
9 | 15555666002 |
10 | 5666090537 |
11 | 24483a6758 |
12 | 112168b6b5 |
13 | 6c3b576c3 |
14 | 3ba72db29 |
15 | 23267b992 |
hex | 151b9ae29 |
5666090537 has 2 divisors, whose sum is σ = 5666090538. Its totient is φ = 5666090536.
The previous prime is 5666090501. The next prime is 5666090539. The reversal of 5666090537 is 7350906665.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5550399001 + 115691536 = 74501^2 + 10756^2 .
It is a cyclic number.
It is not a de Polignac number, because 5666090537 - 28 = 5666090281 is a prime.
Together with 5666090539, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5666090491 and 5666090500.
It is not a weakly prime, because it can be changed into another prime (5666090539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2833045268 + 2833045269.
It is an arithmetic number, because the mean of its divisors is an integer number (2833045269).
Almost surely, 25666090537 is an apocalyptic number.
It is an amenable number.
5666090537 is a deficient number, since it is larger than the sum of its proper divisors (1).
5666090537 is an equidigital number, since it uses as much as digits as its factorization.
5666090537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1020600, while the sum is 47.
The square root of 5666090537 is about 75273.4384560716. The cubic root of 5666090537 is about 1782.7666583906.
The spelling of 5666090537 in words is "five billion, six hundred sixty-six million, ninety thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •