Base | Representation |
---|---|
bin | 1101000110111010001111… |
… | …11110100001001001011001 |
3 | 10210001121200012200000210022 |
4 | 12203131013332201021121 |
5 | 12234231023133010424 |
6 | 141145522150400225 |
7 | 6033342520462313 |
oct | 643350776411131 |
9 | 123047605600708 |
10 | 28824733094489 |
11 | 9203556410a22 |
12 | 3296514960075 |
13 | 1311211ca95c7 |
14 | 7191a59ac7b3 |
15 | 34ebe663c95e |
hex | 1a3747fa1259 |
28824733094489 has 2 divisors, whose sum is σ = 28824733094490. Its totient is φ = 28824733094488.
The previous prime is 28824733094341. The next prime is 28824733094491. The reversal of 28824733094489 is 98449033742882.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22533249486400 + 6291483608089 = 4746920^2 + 2508283^2 .
It is a cyclic number.
It is not a de Polignac number, because 28824733094489 - 28 = 28824733094233 is a prime.
It is a super-2 number, since 2×288247330944892 (a number of 28 digits) contains 22 as substring.
Together with 28824733094491, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (28824733024489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14412366547244 + 14412366547245.
It is an arithmetic number, because the mean of its divisors is an integer number (14412366547245).
Almost surely, 228824733094489 is an apocalyptic number.
It is an amenable number.
28824733094489 is a deficient number, since it is larger than the sum of its proper divisors (1).
28824733094489 is an equidigital number, since it uses as much as digits as its factorization.
28824733094489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 668860416, while the sum is 71.
The spelling of 28824733094489 in words is "twenty-eight trillion, eight hundred twenty-four billion, seven hundred thirty-three million, ninety-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •