Base | Representation |
---|---|
bin | 1010000110011111011000… |
… | …10110111001101101011111 |
3 | 2220122120020222110111100120 |
4 | 11003033230112321231133 |
5 | 10402420204234023033 |
6 | 115124342220330023 |
7 | 4451565553546245 |
oct | 503175426715537 |
9 | 86576228414316 |
10 | 22213241314143 |
11 | 7094645695350 |
12 | 25a90a96a3913 |
13 | c51913229ca9 |
14 | 56b1ab612795 |
15 | 287c3da051b3 |
hex | 1433ec5b9b5f |
22213241314143 has 16 divisors (see below), whose sum is σ = 32313375360000. Its totient is φ = 13461234586880.
The previous prime is 22213241314127. The next prime is 22213241314169. The reversal of 22213241314143 is 34141314231222.
It is a cyclic number.
It is not a de Polignac number, because 22213241314143 - 24 = 22213241314127 is a prime.
It is a super-2 number, since 2×222132413141432 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22213241314543) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33060018 + ... + 33725231.
It is an arithmetic number, because the mean of its divisors is an integer number (2019585960000).
Almost surely, 222213241314143 is an apocalyptic number.
22213241314143 is a deficient number, since it is larger than the sum of its proper divisors (10100134045857).
22213241314143 is a wasteful number, since it uses less digits than its factorization.
22213241314143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66795342.
The product of its digits is 27648, while the sum is 33.
Adding to 22213241314143 its reverse (34141314231222), we get a palindrome (56354555545365).
The spelling of 22213241314143 in words is "twenty-two trillion, two hundred thirteen billion, two hundred forty-one million, three hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •