Base | Representation |
---|---|
bin | 10101010000010000… |
… | …000111011011011001 |
3 | 2011220110012000220011 |
4 | 111100100013123121 |
5 | 333214214112424 |
6 | 14252310201521 |
7 | 1435350220000 |
oct | 252020073331 |
9 | 64813160804 |
10 | 22821238489 |
11 | 9750aa3285 |
12 | 450a9532a1 |
13 | 21c902cc1a |
14 | 1166c77c37 |
15 | 8d879d694 |
hex | 5504076d9 |
22821238489 has 15 divisors (see below), whose sum is σ = 26631832373. Its totient is φ = 19554716748.
The previous prime is 22821238477. The next prime is 22821238529. The reversal of 22821238489 is 98483212822.
The square root of 22821238489 is 151067.
It is a perfect power (a square), and thus also a powerful number.
It is a de Polignac number, because none of the positive numbers 2k-22821238489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22821238439) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 7400742 + ... + 7403824.
Almost surely, 222821238489 is an apocalyptic number.
22821238489 is the 151067-th square number.
22821238489 is the 75534-th centered octagonal number.
It is an amenable number.
22821238489 is a deficient number, since it is larger than the sum of its proper divisors (3810593884).
22821238489 is an frugal number, since it uses more digits than its factorization.
22821238489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6194 (or 3090 counting only the distinct ones).
The product of its digits is 884736, while the sum is 49.
Multiplying 22821238489 by its sum of digits (49), we get a square (1118240685961 = 10574692).
22821238489 divided by its sum of digits (49) gives a square (465739561 = 215812).
The spelling of 22821238489 in words is "twenty-two billion, eight hundred twenty-one million, two hundred thirty-eight thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •