Base | Representation |
---|---|
bin | 111101000010110… |
… | …010001100000101 |
3 | 2122101002201000111 |
4 | 331002302030011 |
5 | 4044134440122 |
6 | 245342513021 |
7 | 34244022004 |
oct | 7502621405 |
9 | 2571081014 |
10 | 1024140037 |
11 | 486111628 |
12 | 246b95771 |
13 | 13423cb2b |
14 | 9a032c3b |
15 | 5ed9dd77 |
hex | 3d0b2305 |
1024140037 has 2 divisors, whose sum is σ = 1024140038. Its totient is φ = 1024140036.
The previous prime is 1024139981. The next prime is 1024140049. The reversal of 1024140037 is 7300414201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 813048196 + 211091841 = 28514^2 + 14529^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1024140037 is a prime.
It is a super-2 number, since 2×10241400372 = 2097725630772722738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1024140077) 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, 512070018 + 512070019.
It is an arithmetic number, because the mean of its divisors is an integer number (512070019).
Almost surely, 21024140037 is an apocalyptic number.
It is an amenable number.
1024140037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1024140037 is an equidigital number, since it uses as much as digits as its factorization.
1024140037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 1024140037 is about 32002.1880033225. The cubic root of 1024140037 is about 1007.9827845831.
Adding to 1024140037 its reverse (7300414201), we get a palindrome (8324554238).
The spelling of 1024140037 in words is "one billion, twenty-four million, one hundred forty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •