Base | Representation |
---|---|
bin | 1010000100111100111110… |
… | …00100100100011001000011 |
3 | 2220110111212201201102200101 |
4 | 11002132133010210121003 |
5 | 10401034002143230133 |
6 | 115044203300103231 |
7 | 4445015332010443 |
oct | 502363704443103 |
9 | 86414781642611 |
10 | 22160405055043 |
11 | 70741a1a29912 |
12 | 259aa02994b17 |
13 | c499429a6158 |
14 | 5687d8340123 |
15 | 28669a16237d |
hex | 14279f124643 |
22160405055043 has 8 divisors (see below), whose sum is σ = 22267954706400. Its totient is φ = 22052961734208.
The previous prime is 22160405055037. The next prime is 22160405055049. The reversal of 22160405055043 is 34055050406122.
It is an interprime number because it is at equal distance from previous prime (22160405055037) and next prime (22160405055049).
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 22160405055043 - 29 = 22160405054531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22160405054993 and 22160405055011.
It is not an unprimeable number, because it can be changed into a prime (22160405055049) 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, 26164783 + ... + 26998456.
It is an arithmetic number, because the mean of its divisors is an integer number (2783494338300).
Almost surely, 222160405055043 is an apocalyptic number.
22160405055043 is a deficient number, since it is larger than the sum of its proper divisors (107549651357).
22160405055043 is a wasteful number, since it uses less digits than its factorization.
22160405055043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53165261.
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 22160405055043 in words is "twenty-two trillion, one hundred sixty billion, four hundred five million, fifty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •