Base | Representation |
---|---|
bin | 1010000100011001001000… |
… | …01011111000010110100111 |
3 | 2220101200012202100102021010 |
4 | 11002030210023320112213 |
5 | 10400230100324130223 |
6 | 115031302102553303 |
7 | 4443434446355211 |
oct | 502144413702647 |
9 | 86350182312233 |
10 | 22141163505063 |
11 | 7067018641599 |
12 | 2597132a38833 |
13 | c47b97494215 |
14 | 5678d0a895b1 |
15 | 285e20cb2393 |
hex | 1423242f85a7 |
22141163505063 has 8 divisors (see below), whose sum is σ = 29521845159408. Its totient is φ = 14760628760384.
The previous prime is 22141163505061. The next prime is 22141163505073. The reversal of 22141163505063 is 36050536114122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22141163505063 - 21 = 22141163505061 is a prime.
It is a super-2 number, since 2×221411635050632 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22141163505061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36375270 + ... + 36978947.
It is an arithmetic number, because the mean of its divisors is an integer number (3690230644926).
Almost surely, 222141163505063 is an apocalyptic number.
22141163505063 is a deficient number, since it is larger than the sum of its proper divisors (7380681654345).
22141163505063 is a wasteful number, since it uses less digits than its factorization.
22141163505063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73454833.
The product of its (nonzero) digits is 129600, while the sum is 39.
Adding to 22141163505063 its reverse (36050536114122), we get a palindrome (58191699619185).
The spelling of 22141163505063 in words is "twenty-two trillion, one hundred forty-one billion, one hundred sixty-three million, five hundred five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •