Base | Representation |
---|---|
bin | 100010000110011… |
… | …0111000110100101 |
3 | 2221202001111122221 |
4 | 1010030313012211 |
5 | 4320410101432 |
6 | 305312352341 |
7 | 40232504353 |
oct | 10414670645 |
9 | 2852044587 |
10 | 1144222117 |
11 | 53797a015 |
12 | 27b2456b1 |
13 | 15309520c |
14 | abd707d3 |
15 | 6a6bdb97 |
hex | 443371a5 |
1144222117 has 2 divisors, whose sum is σ = 1144222118. Its totient is φ = 1144222116.
The previous prime is 1144222109. The next prime is 1144222127. The reversal of 1144222117 is 7112224411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1115159236 + 29062881 = 33394^2 + 5391^2 .
It is an emirp because it is prime and its reverse (7112224411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1144222117 - 23 = 1144222109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1144222091 and 1144222100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1144222127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572111058 + 572111059.
It is an arithmetic number, because the mean of its divisors is an integer number (572111059).
Almost surely, 21144222117 is an apocalyptic number.
It is an amenable number.
1144222117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144222117 is an equidigital number, since it uses as much as digits as its factorization.
1144222117 is an evil number, because the sum of its binary digits is even.
The product of its digits is 896, while the sum is 25.
The square root of 1144222117 is about 33826.3524045972. The cubic root of 1144222117 is about 1045.9319896872.
Adding to 1144222117 its reverse (7112224411), we get a palindrome (8256446528).
The spelling of 1144222117 in words is "one billion, one hundred forty-four million, two hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •