Base | Representation |
---|---|
bin | 111101010110010… |
… | …0101110010000001 |
3 | 12022110110010002102 |
4 | 1322230211302001 |
5 | 13203434300231 |
6 | 540133000145 |
7 | 102004020152 |
oct | 17254456201 |
9 | 5273403072 |
10 | 2058509441 |
11 | 966a7a67a |
12 | 495483055 |
13 | 26a621a31 |
14 | 157569929 |
15 | c0abdacb |
hex | 7ab25c81 |
2058509441 has 2 divisors, whose sum is σ = 2058509442. Its totient is φ = 2058509440.
The previous prime is 2058509371. The next prime is 2058509443. The reversal of 2058509441 is 1449058502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1054950400 + 1003559041 = 32480^2 + 31679^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2058509441 is a prime.
It is a super-2 number, since 2×20585094412 = 8474922237372264962, which contains 22 as substring.
Together with 2058509443, 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 = 2058509395 and 2058509404.
It is not a weakly prime, because it can be changed into another prime (2058509443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1029254720 + 1029254721.
It is an arithmetic number, because the mean of its divisors is an integer number (1029254721).
Almost surely, 22058509441 is an apocalyptic number.
It is an amenable number.
2058509441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2058509441 is an equidigital number, since it uses as much as digits as its factorization.
2058509441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 38.
The square root of 2058509441 is about 45370.7994309115. The cubic root of 2058509441 is about 1272.0893627555.
The spelling of 2058509441 in words is "two billion, fifty-eight million, five hundred nine thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •