Base | Representation |
---|---|
bin | 1010100110011100… |
… | …0000011110000001 |
3 | 21100022110012010012 |
4 | 2221213000132001 |
5 | 21311431400131 |
6 | 1150210314305 |
7 | 130341663101 |
oct | 25147003601 |
9 | 7308405105 |
10 | 2845575041 |
11 | 1230286711 |
12 | 674b88995 |
13 | 3646c651a |
14 | 1cdcc9201 |
15 | 119c3d52b |
hex | a99c0781 |
2845575041 has 2 divisors, whose sum is σ = 2845575042. Its totient is φ = 2845575040.
The previous prime is 2845575011. The next prime is 2845575059. The reversal of 2845575041 is 1405755482.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2717432641 + 128142400 = 52129^2 + 11320^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2845575041 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2845575041.
It is not a weakly prime, because it can be changed into another prime (2845575011) 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, 1422787520 + 1422787521.
It is an arithmetic number, because the mean of its divisors is an integer number (1422787521).
Almost surely, 22845575041 is an apocalyptic number.
It is an amenable number.
2845575041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2845575041 is an equidigital number, since it uses as much as digits as its factorization.
2845575041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224000, while the sum is 41.
The square root of 2845575041 is about 53343.9316230066. The cubic root of 2845575041 is about 1417.0657920829.
The spelling of 2845575041 in words is "two billion, eight hundred forty-five million, five hundred seventy-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •