Base | Representation |
---|---|
bin | 1010000100011001000010… |
… | …01011101011010111011111 |
3 | 2220101200002020112121020221 |
4 | 11002030201023223113133 |
5 | 10400224444424321343 |
6 | 115031253103022211 |
7 | 4443433265165506 |
oct | 502144113532737 |
9 | 86350066477227 |
10 | 22141113120223 |
11 | 7066aa2158729 |
12 | 2597119b9a967 |
13 | c47b89c028c6 |
14 | 5678c80d183d |
15 | 285e1b65d5ed |
hex | 1423212eb5df |
22141113120223 has 2 divisors, whose sum is σ = 22141113120224. Its totient is φ = 22141113120222.
The previous prime is 22141113120199. The next prime is 22141113120227. The reversal of 22141113120223 is 32202131114122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22141113120223 - 237 = 22003674166751 is a prime.
It is a super-2 number, since 2×221411131202232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22141113120227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11070556560111 + 11070556560112.
It is an arithmetic number, because the mean of its divisors is an integer number (11070556560112).
Almost surely, 222141113120223 is an apocalyptic number.
22141113120223 is a deficient number, since it is larger than the sum of its proper divisors (1).
22141113120223 is an equidigital number, since it uses as much as digits as its factorization.
22141113120223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 22141113120223 its reverse (32202131114122), we get a palindrome (54343244234345).
The spelling of 22141113120223 in words is "twenty-two trillion, one hundred forty-one billion, one hundred thirteen million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •