Base | Representation |
---|---|
bin | 111011101010101… |
… | …011001001001101 |
3 | 2120202122020011111 |
4 | 323222223021031 |
5 | 4022231330014 |
6 | 243155452021 |
7 | 33543502165 |
oct | 7352531115 |
9 | 2522566144 |
10 | 1001042509 |
11 | 474076065 |
12 | 23b2b7011 |
13 | 12c51385c |
14 | 96d3d5a5 |
15 | 5cd3a2c4 |
hex | 3baab24d |
1001042509 has 2 divisors, whose sum is σ = 1001042510. Its totient is φ = 1001042508.
The previous prime is 1001042431. The next prime is 1001042521. The reversal of 1001042509 is 9052401001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 859955625 + 141086884 = 29325^2 + 11878^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001042509 - 27 = 1001042381 is a prime.
It is a super-2 number, since 2×10010425092 = 2004172209650030162, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1001042509.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001042579) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500521254 + 500521255.
It is an arithmetic number, because the mean of its divisors is an integer number (500521255).
Almost surely, 21001042509 is an apocalyptic number.
It is an amenable number.
1001042509 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001042509 is an equidigital number, since it uses as much as digits as its factorization.
1001042509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 1001042509 is about 31639.2558224747. The cubic root of 1001042509 is about 1000.3473823116.
The spelling of 1001042509 in words is "one billion, one million, forty-two thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •