Base | Representation |
---|---|
bin | 1010000100011100111100… |
… | …01011110010011011011111 |
3 | 2220101212111101202102122122 |
4 | 11002032132023302123133 |
5 | 10400243243314114101 |
6 | 115032241140533155 |
7 | 4443536252011562 |
oct | 502163613623337 |
9 | 86355441672578 |
10 | 22143210301151 |
11 | 7067978a40805 |
12 | 25976043b11bb |
13 | c48132544574 |
14 | 567a468464d9 |
15 | 285ee081a51b |
hex | 14239e2f26df |
22143210301151 has 2 divisors, whose sum is σ = 22143210301152. Its totient is φ = 22143210301150.
The previous prime is 22143210301139. The next prime is 22143210301279. The reversal of 22143210301151 is 15110301234122.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22143210301151 - 230 = 22142136559327 is a prime.
It is a super-2 number, since 2×221432103011512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22143210301151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22143210301111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11071605150575 + 11071605150576.
It is an arithmetic number, because the mean of its divisors is an integer number (11071605150576).
Almost surely, 222143210301151 is an apocalyptic number.
22143210301151 is a deficient number, since it is larger than the sum of its proper divisors (1).
22143210301151 is an equidigital number, since it uses as much as digits as its factorization.
22143210301151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 22143210301151 its reverse (15110301234122), we get a palindrome (37253511535273).
The spelling of 22143210301151 in words is "twenty-two trillion, one hundred forty-three billion, two hundred ten million, three hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •