Base | Representation |
---|---|
bin | 10100110100011110… |
… | …011000011100001101 |
3 | 2010200222021122102012 |
4 | 110310132120130031 |
5 | 331240413404031 |
6 | 14134141511005 |
7 | 1420661126156 |
oct | 246436303415 |
9 | 63628248365 |
10 | 22355216141 |
11 | 9531a33845 |
12 | 43ba872465 |
13 | 215361345b |
14 | 112100892d |
15 | 8ac8e7b2b |
hex | 53479870d |
22355216141 has 2 divisors, whose sum is σ = 22355216142. Its totient is φ = 22355216140.
The previous prime is 22355216131. The next prime is 22355216173. The reversal of 22355216141 is 14161255322.
It is an a-pointer prime, because the next prime (22355216173) can be obtained adding 22355216141 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17394972100 + 4960244041 = 131890^2 + 70429^2 .
It is a cyclic number.
It is not a de Polignac number, because 22355216141 - 226 = 22288107277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22355216098 and 22355216107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22355216131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11177608070 + 11177608071.
It is an arithmetic number, because the mean of its divisors is an integer number (11177608071).
Almost surely, 222355216141 is an apocalyptic number.
It is an amenable number.
22355216141 is a deficient number, since it is larger than the sum of its proper divisors (1).
22355216141 is an equidigital number, since it uses as much as digits as its factorization.
22355216141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 32.
The spelling of 22355216141 in words is "twenty-two billion, three hundred fifty-five million, two hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •