Base | Representation |
---|---|
bin | 10100110111111011… |
… | …011011000001110001 |
3 | 2010212000022112012211 |
4 | 110313323123001301 |
5 | 331400232114221 |
6 | 14144011452121 |
7 | 1422263502301 |
oct | 246773330161 |
9 | 63760275184 |
10 | 22413160561 |
11 | 95617102a0 |
12 | 4416157041 |
13 | 21626208ac |
14 | 11289ad601 |
15 | 8b2a416e1 |
hex | 537edb071 |
22413160561 has 4 divisors (see below), whose sum is σ = 24450720624. Its totient is φ = 20375600500.
The previous prime is 22413160481. The next prime is 22413160597. The reversal of 22413160561 is 16506131422.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22413160561 - 27 = 22413160433 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (22413160261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1018780015 + ... + 1018780036.
It is an arithmetic number, because the mean of its divisors is an integer number (6112680156).
Almost surely, 222413160561 is an apocalyptic number.
It is an amenable number.
22413160561 is a deficient number, since it is larger than the sum of its proper divisors (2037560063).
22413160561 is a wasteful number, since it uses less digits than its factorization.
22413160561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2037560062.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 22413160561 its reverse (16506131422), we get a palindrome (38919291983).
The spelling of 22413160561 in words is "twenty-two billion, four hundred thirteen million, one hundred sixty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •