Base | Representation |
---|---|
bin | 10101000101100010… |
… | …010001001100001001 |
3 | 2011102220212201021122 |
4 | 111011202101030021 |
5 | 332332202311224 |
6 | 14222404445025 |
7 | 1431035062400 |
oct | 250542211411 |
9 | 64386781248 |
10 | 22641447689 |
11 | 9669563843 |
12 | 447a6a9775 |
13 | 219aa00333 |
14 | 114b036637 |
15 | 8c7ad715e |
hex | 545891309 |
22641447689 has 6 divisors (see below), whose sum is σ = 26338010634. Its totient is φ = 19406955120.
The previous prime is 22641447643. The next prime is 22641447691. The reversal of 22641447689 is 98674414622.
It can be written as a sum of positive squares in only one way, i.e., 18072769225 + 4568678464 = 134435^2 + 67592^2 .
It is a de Polignac number, because none of the positive numbers 2k-22641447689 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22641447689.
It is not an unprimeable number, because it can be changed into a prime (22641447889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 231035132 + ... + 231035229.
It is an arithmetic number, because the mean of its divisors is an integer number (4389668439).
Almost surely, 222641447689 is an apocalyptic number.
It is an amenable number.
22641447689 is a deficient number, since it is larger than the sum of its proper divisors (3696562945).
22641447689 is an equidigital number, since it uses as much as digits as its factorization.
22641447689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462070375 (or 462070368 counting only the distinct ones).
The product of its digits is 4644864, while the sum is 53.
The spelling of 22641447689 in words is "twenty-two billion, six hundred forty-one million, four hundred forty-seven thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •