Base | Representation |
---|---|
bin | 101100011111110… |
… | …0010011010100001 |
3 | 10212001102211222201 |
4 | 1120333202122201 |
5 | 11024210113131 |
6 | 404053133201 |
7 | 51666503326 |
oct | 13077423241 |
9 | 3761384881 |
10 | 1493051041 |
11 | 6a6874389 |
12 | 35802a201 |
13 | 1aa42b371 |
14 | 102414b4d |
15 | 8b125761 |
hex | 58fe26a1 |
1493051041 has 2 divisors, whose sum is σ = 1493051042. Its totient is φ = 1493051040.
The previous prime is 1493051029. The next prime is 1493051057. The reversal of 1493051041 is 1401503941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1402877025 + 90174016 = 37455^2 + 9496^2 .
It is an emirp because it is prime and its reverse (1401503941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1493051041 - 215 = 1493018273 is a prime.
It is a super-3 number, since 3×14930510413 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1493061041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 746525520 + 746525521.
It is an arithmetic number, because the mean of its divisors is an integer number (746525521).
Almost surely, 21493051041 is an apocalyptic number.
It is an amenable number.
1493051041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1493051041 is an equidigital number, since it uses as much as digits as its factorization.
1493051041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 1493051041 is about 38640.0186464758. The cubic root of 1493051041 is about 1142.9438230855.
Adding to 1493051041 its reverse (1401503941), we get a palindrome (2894554982).
The spelling of 1493051041 in words is "one billion, four hundred ninety-three million, fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •