Base | Representation |
---|---|
bin | 110001000001101… |
… | …0001101011111001 |
3 | 11020122101222111102 |
4 | 1202003101223321 |
5 | 11332111313131 |
6 | 431122341145 |
7 | 55523330201 |
oct | 14203215371 |
9 | 4218358442 |
10 | 1645026041 |
11 | 77463545a |
12 | 39aaba7b5 |
13 | 202a6c1b9 |
14 | 118695401 |
15 | 996451cb |
hex | 620d1af9 |
1645026041 has 2 divisors, whose sum is σ = 1645026042. Its totient is φ = 1645026040.
The previous prime is 1645026013. The next prime is 1645026049. The reversal of 1645026041 is 1406205461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1181915641 + 463110400 = 34379^2 + 21520^2 .
It is a cyclic number.
It is not a de Polignac number, because 1645026041 - 222 = 1640831737 is a prime.
It is a super-2 number, since 2×16450260412 = 5412221351136267362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1645025995 and 1645026013.
It is not a weakly prime, because it can be changed into another prime (1645026049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 822513020 + 822513021.
It is an arithmetic number, because the mean of its divisors is an integer number (822513021).
Almost surely, 21645026041 is an apocalyptic number.
It is an amenable number.
1645026041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1645026041 is an equidigital number, since it uses as much as digits as its factorization.
1645026041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 1645026041 is about 40558.9206094048. The cubic root of 1645026041 is about 1180.4771700814.
It can be divided in two parts, 164 and 5026041, that added together give a palindrome (5026205).
The spelling of 1645026041 in words is "one billion, six hundred forty-five million, twenty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •