Base | Representation |
---|---|
bin | 10100100011101101… |
… | …10111100000000001 |
3 | 1001111012002101220221 |
4 | 22101312313200001 |
5 | 140100433422032 |
6 | 5023105303041 |
7 | 540336033301 |
oct | 122166674001 |
9 | 31435071827 |
10 | 11037014017 |
11 | 4754119a97 |
12 | 2180334a81 |
13 | 106b7b7033 |
14 | 769b87601 |
15 | 448e51597 |
hex | 291db7801 |
11037014017 has 2 divisors, whose sum is σ = 11037014018. Its totient is φ = 11037014016.
The previous prime is 11037013997. The next prime is 11037014069. The reversal of 11037014017 is 71041073011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6696312561 + 4340701456 = 81831^2 + 65884^2 .
It is a cyclic number.
It is not a de Polignac number, because 11037014017 - 219 = 11036489729 is a prime.
It is a super-2 number, since 2×110370140172 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11037013982 and 11037014000.
It is not a weakly prime, because it can be changed into another prime (11037011017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5518507008 + 5518507009.
It is an arithmetic number, because the mean of its divisors is an integer number (5518507009).
Almost surely, 211037014017 is an apocalyptic number.
It is an amenable number.
11037014017 is a deficient number, since it is larger than the sum of its proper divisors (1).
11037014017 is an equidigital number, since it uses as much as digits as its factorization.
11037014017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 588, while the sum is 25.
Adding to 11037014017 its reverse (71041073011), we get a palindrome (82078087028).
The spelling of 11037014017 in words is "eleven billion, thirty-seven million, fourteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •