Base | Representation |
---|---|
bin | 10100101100110010… |
… | …000110001111010101 |
3 | 2010100222110020220210 |
4 | 110230302012033111 |
5 | 331004344313431 |
6 | 14113251520033 |
7 | 1414533204642 |
oct | 245462061725 |
9 | 63328406823 |
10 | 22226166741 |
11 | 9476101049 |
12 | 43835b9019 |
13 | 213296b56c |
14 | 110bc14dc9 |
15 | 8a1405d46 |
hex | 52cc863d5 |
22226166741 has 8 divisors (see below), whose sum is σ = 31378117824. Its totient is φ = 13945830080.
The previous prime is 22226166727. The next prime is 22226166797. The reversal of 22226166741 is 14766162222.
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 22226166741 - 25 = 22226166709 is a prime.
It is a super-2 number, since 2×222261667412 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22226166741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22226166041) 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 in 7 ways as a sum of consecutive naturals, for example, 217903545 + ... + 217903646.
It is an arithmetic number, because the mean of its divisors is an integer number (3922264728).
Almost surely, 222226166741 is an apocalyptic number.
It is an amenable number.
22226166741 is a deficient number, since it is larger than the sum of its proper divisors (9151951083).
22226166741 is a wasteful number, since it uses less digits than its factorization.
22226166741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435807211.
The product of its digits is 96768, while the sum is 39.
The spelling of 22226166741 in words is "twenty-two billion, two hundred twenty-six million, one hundred sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •