Base | Representation |
---|---|
bin | 1100110101111100001010… |
… | …10000001111001110000001 |
3 | 10200222212121211200011000001 |
4 | 12122332011100033032001 |
5 | 12200202342233110234 |
6 | 140022011034000001 |
7 | 5643251206516405 |
oct | 632760520171601 |
9 | 120885554604001 |
10 | 28241645597569 |
11 | 8aa923a7552a8 |
12 | 3201505b76001 |
13 | 129b239188991 |
14 | 6d8c8d94d105 |
15 | 33e96b461d14 |
hex | 19af8540f381 |
28241645597569 has 4 divisors (see below), whose sum is σ = 28399420154160. Its totient is φ = 28083871040980.
The previous prime is 28241645597567. The next prime is 28241645597609. The reversal of 28241645597569 is 96579554614282.
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 28241645597569 - 21 = 28241645597567 is a prime.
It is a super-2 number, since 2×282416455975692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28241645597567) 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, 78887278027 + ... + 78887278384.
It is an arithmetic number, because the mean of its divisors is an integer number (7099855038540).
Almost surely, 228241645597569 is an apocalyptic number.
It is an amenable number.
28241645597569 is a deficient number, since it is larger than the sum of its proper divisors (157774556591).
28241645597569 is a wasteful number, since it uses less digits than its factorization.
28241645597569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157774556590.
The product of its digits is 1306368000, while the sum is 73.
The spelling of 28241645597569 in words is "twenty-eight trillion, two hundred forty-one billion, six hundred forty-five million, five hundred ninety-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •