Base | Representation |
---|---|
bin | 101100011010000… |
… | …000111011010001 |
3 | 1220220212210020202 |
4 | 230122000323101 |
5 | 3011211021131 |
6 | 201532144545 |
7 | 24314353226 |
oct | 5432007321 |
9 | 1826783222 |
10 | 745017041 |
11 | 3525a736a |
12 | 189608155 |
13 | bb4716b2 |
14 | 70d3594d |
15 | 45615bcb |
hex | 2c680ed1 |
745017041 has 2 divisors, whose sum is σ = 745017042. Its totient is φ = 745017040.
The previous prime is 745017001. The next prime is 745017067. The reversal of 745017041 is 140710547.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 745017025 + 16 = 27295^2 + 4^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-745017041 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 745016995 and 745017013.
It is not a weakly prime, because it can be changed into another prime (745017001) 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, 372508520 + 372508521.
It is an arithmetic number, because the mean of its divisors is an integer number (372508521).
Almost surely, 2745017041 is an apocalyptic number.
It is an amenable number.
745017041 is a deficient number, since it is larger than the sum of its proper divisors (1).
745017041 is an equidigital number, since it uses as much as digits as its factorization.
745017041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3920, while the sum is 29.
The square root of 745017041 is about 27295.0002930940. Note that the first 3 decimals coincide. The cubic root of 745017041 is about 906.5436820612.
Adding to 745017041 its reverse (140710547), we get a palindrome (885727588).
The spelling of 745017041 in words is "seven hundred forty-five million, seventeen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •