Base | Representation |
---|---|
bin | 10100111000110100… |
… | …00110000110011001 |
3 | 1001221112011021212202 |
4 | 22130122012012121 |
5 | 140431242133032 |
6 | 5052431215545 |
7 | 544615414553 |
oct | 123432060631 |
9 | 31845137782 |
10 | 11214021017 |
11 | 4835027a71 |
12 | 220b6775b5 |
13 | 10993807c4 |
14 | 7854a24d3 |
15 | 459767d62 |
hex | 29c686199 |
11214021017 has 2 divisors, whose sum is σ = 11214021018. Its totient is φ = 11214021016.
The previous prime is 11214021001. The next prime is 11214021019. The reversal of 11214021017 is 71012041211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10748712976 + 465308041 = 103676^2 + 21571^2 .
It is an emirp because it is prime and its reverse (71012041211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11214021017 - 24 = 11214021001 is a prime.
Together with 11214021019, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11214021017.
It is not a weakly prime, because it can be changed into another prime (11214021019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5607010508 + 5607010509.
It is an arithmetic number, because the mean of its divisors is an integer number (5607010509).
Almost surely, 211214021017 is an apocalyptic number.
It is an amenable number.
11214021017 is a deficient number, since it is larger than the sum of its proper divisors (1).
11214021017 is an equidigital number, since it uses as much as digits as its factorization.
11214021017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 11214021017 its reverse (71012041211), we get a palindrome (82226062228).
The spelling of 11214021017 in words is "eleven billion, two hundred fourteen million, twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •