Base | Representation |
---|---|
bin | 1010000100011100111101… |
… | …10101001000101010011011 |
3 | 2220101212112011011002221001 |
4 | 11002032132311020222123 |
5 | 10400243304102440443 |
6 | 115032242205125431 |
7 | 4443536443104226 |
oct | 502163665105233 |
9 | 86355464132831 |
10 | 22143221140123 |
11 | 7067984074236 |
12 | 2597607b59877 |
13 | c4813486ac65 |
14 | 567a480685bd |
15 | 285ee175bd4d |
hex | 14239ed48a9b |
22143221140123 has 8 divisors (see below), whose sum is σ = 22862923678080. Its totient is φ = 21423856419840.
The previous prime is 22143221140109. The next prime is 22143221140231. The reversal of 22143221140123 is 32104112234122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22143221140123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22143221140091 and 22143221140100.
It is not an unprimeable number, because it can be changed into a prime (22143224140123) 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, 84321190 + ... + 84583387.
It is an arithmetic number, because the mean of its divisors is an integer number (2857865459760).
Almost surely, 222143221140123 is an apocalyptic number.
22143221140123 is a deficient number, since it is larger than the sum of its proper divisors (719702537957).
22143221140123 is a wasteful number, since it uses less digits than its factorization.
22143221140123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168908837.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 22143221140123 its reverse (32104112234122), we get a palindrome (54247333374245).
The spelling of 22143221140123 in words is "twenty-two trillion, one hundred forty-three billion, two hundred twenty-one million, one hundred forty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •