Base | Representation |
---|---|
bin | 1010000100011110110111… |
… | …10011111000010011110011 |
3 | 2220101222011110021000021201 |
4 | 11002033123303320103303 |
5 | 10400302403010034141 |
6 | 115032531513232031 |
7 | 4443604005125632 |
oct | 502173363702363 |
9 | 86358143230251 |
10 | 22144244221171 |
11 | 7068359622166 |
12 | 2597852702617 |
13 | c482687c9a67 |
14 | 567b03ca3519 |
15 | 28605149c031 |
hex | 1423dbcf84f3 |
22144244221171 has 2 divisors, whose sum is σ = 22144244221172. Its totient is φ = 22144244221170.
The previous prime is 22144244221163. The next prime is 22144244221223. The reversal of 22144244221171 is 17112244244122.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22144244221171 - 23 = 22144244221163 is a prime.
It is a super-3 number, since 3×221442442211713 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 22144244221171.
It is not a weakly prime, because it can be changed into another prime (22144244221271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11072122110585 + 11072122110586.
It is an arithmetic number, because the mean of its divisors is an integer number (11072122110586).
Almost surely, 222144244221171 is an apocalyptic number.
22144244221171 is a deficient number, since it is larger than the sum of its proper divisors (1).
22144244221171 is an equidigital number, since it uses as much as digits as its factorization.
22144244221171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 57344, while the sum is 37.
Adding to 22144244221171 its reverse (17112244244122), we get a palindrome (39256488465293).
The spelling of 22144244221171 in words is "twenty-two trillion, one hundred forty-four billion, two hundred forty-four million, two hundred twenty-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •