Base | Representation |
---|---|
bin | 111101010110001… |
… | …0111111010110001 |
3 | 12022110100020012022 |
4 | 1322230113322301 |
5 | 13203430441112 |
6 | 540131441225 |
7 | 102003362462 |
oct | 17254277261 |
9 | 5273306168 |
10 | 2058452657 |
11 | 966a40a48 |
12 | 495456215 |
13 | 26a601c31 |
14 | 157552d69 |
15 | c0aabd72 |
hex | 7ab17eb1 |
2058452657 has 2 divisors, whose sum is σ = 2058452658. Its totient is φ = 2058452656.
The previous prime is 2058452639. The next prime is 2058452659. The reversal of 2058452657 is 7562548502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1345349041 + 713103616 = 36679^2 + 26704^2 .
It is a cyclic number.
It is not a de Polignac number, because 2058452657 - 220 = 2057404081 is a prime.
It is a super-2 number, since 2×20584526572 = 8474454682220719298, which contains 22 as substring.
Together with 2058452659, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2058452659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1029226328 + 1029226329.
It is an arithmetic number, because the mean of its divisors is an integer number (1029226329).
Almost surely, 22058452657 is an apocalyptic number.
It is an amenable number.
2058452657 is a deficient number, since it is larger than the sum of its proper divisors (1).
2058452657 is an equidigital number, since it uses as much as digits as its factorization.
2058452657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672000, while the sum is 44.
The square root of 2058452657 is about 45370.1736496567. The cubic root of 2058452657 is about 1272.0776657828.
The spelling of 2058452657 in words is "two billion, fifty-eight million, four hundred fifty-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •