Base | Representation |
---|---|
bin | 10100101010100011… |
… | …110011011000100011 |
3 | 2010021101021010122000 |
4 | 110222203303120203 |
5 | 330420322140214 |
6 | 14105440215043 |
7 | 1413601145454 |
oct | 245243633043 |
9 | 63241233560 |
10 | 22188865059 |
11 | 9457043809 |
12 | 437300a483 |
13 | 212800ac6a |
14 | 1106ca512b |
15 | 89ced8809 |
hex | 52a8f3623 |
22188865059 has 16 divisors (see below), whose sum is σ = 32875316640. Its totient is φ = 14791260960.
The previous prime is 22188865007. The next prime is 22188865121. The reversal of 22188865059 is 95056888122.
It is a happy number.
It is not a de Polignac number, because 22188865059 - 215 = 22188832291 is a prime.
It is a super-2 number, since 2×221888650592 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 22188864996 and 22188865014.
It is not an unprimeable number, because it can be changed into a prime (22188865759) 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 15 ways as a sum of consecutive naturals, for example, 345069 + ... + 404289.
It is an arithmetic number, because the mean of its divisors is an integer number (2054707290).
Almost surely, 222188865059 is an apocalyptic number.
22188865059 is a deficient number, since it is larger than the sum of its proper divisors (10686451581).
22188865059 is a wasteful number, since it uses less digits than its factorization.
22188865059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73107 (or 73101 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 54.
The spelling of 22188865059 in words is "twenty-two billion, one hundred eighty-eight million, eight hundred sixty-five thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •