Base | Representation |
---|---|
bin | 111100011001001… |
… | …111101100000001 |
3 | 2121121121110211001 |
4 | 330121033230001 |
5 | 4033343011232 |
6 | 244313252001 |
7 | 34052330005 |
oct | 7431175401 |
9 | 2547543731 |
10 | 1013250817 |
11 | 47aa54377 |
12 | 243404001 |
13 | 131bc95c7 |
14 | 987da705 |
15 | 5de4c6e7 |
hex | 3c64fb01 |
1013250817 has 2 divisors, whose sum is σ = 1013250818. Its totient is φ = 1013250816.
The previous prime is 1013250781. The next prime is 1013250827. The reversal of 1013250817 is 7180523101.
1013250817 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (1013250781) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 538054416 + 475196401 = 23196^2 + 21799^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013250817 - 215 = 1013218049 is a prime.
It is not a weakly prime, because it can be changed into another prime (1013250827) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506625408 + 506625409.
It is an arithmetic number, because the mean of its divisors is an integer number (506625409).
Almost surely, 21013250817 is an apocalyptic number.
It is an amenable number.
1013250817 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013250817 is an equidigital number, since it uses as much as digits as its factorization.
1013250817 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 1013250817 is about 31831.6009179557. The cubic root of 1013250817 is about 1004.3975720127.
Adding to 1013250817 its reverse (7180523101), we get a palindrome (8193773918).
The spelling of 1013250817 in words is "one billion, thirteen million, two hundred fifty thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •