Base | Representation |
---|---|
bin | 10100110111110000… |
… | …111100010010100111 |
3 | 2010211211010221120120 |
4 | 110313300330102213 |
5 | 331344031210343 |
6 | 14143432533023 |
7 | 1422231240462 |
oct | 246760742247 |
9 | 63754127516 |
10 | 22410413223 |
11 | 9560104170 |
12 | 4415251173 |
13 | 2161b9b253 |
14 | 11284962d9 |
15 | 8b269c683 |
hex | 537c3c4a7 |
22410413223 has 16 divisors (see below), whose sum is σ = 32736877056. Its totient is φ = 13523771840.
The previous prime is 22410413219. The next prime is 22410413281. The reversal of 22410413223 is 32231401422.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 22410413223 - 22 = 22410413219 is a prime.
It is a super-2 number, since 2×224104132232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22410413193 and 22410413202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22410413213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1449615 + ... + 1464992.
It is an arithmetic number, because the mean of its divisors is an integer number (2046054816).
Almost surely, 222410413223 is an apocalyptic number.
22410413223 is a deficient number, since it is larger than the sum of its proper divisors (10326463833).
22410413223 is a wasteful number, since it uses less digits than its factorization.
22410413223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2914854.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 22410413223 its reverse (32231401422), we get a palindrome (54641814645).
The spelling of 22410413223 in words is "twenty-two billion, four hundred ten million, four hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •