Base | Representation |
---|---|
bin | 11010001000101100… |
… | …011001101110111001 |
3 | 2200102202202110122122 |
4 | 122020230121232321 |
5 | 424433131114024 |
6 | 20520402331025 |
7 | 2012300536643 |
oct | 321054315671 |
9 | 80382673578 |
10 | 28063144889 |
11 | 109a0a0612a |
12 | 5532359a75 |
13 | 28530292a0 |
14 | 1503109893 |
15 | ae3a8ad5e |
hex | 688b19bb9 |
28063144889 has 8 divisors (see below), whose sum is σ = 30270838920. Its totient is φ = 25862449536.
The previous prime is 28063144861. The next prime is 28063144891. The reversal of 28063144889 is 98844136082.
It can be written as a sum of positive squares in 4 ways, for example, as 2630869264 + 25432275625 = 51292^2 + 159475^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28063144889 - 212 = 28063140793 is a prime.
It is a super-2 number, since 2×280631448892 (a number of 22 digits) contains 22 as substring.
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 28063144889.
It is not an unprimeable number, because it can be changed into a prime (28063144829) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1741334 + ... + 1757375.
It is an arithmetic number, because the mean of its divisors is an integer number (3783854865).
Almost surely, 228063144889 is an apocalyptic number.
It is an amenable number.
28063144889 is a deficient number, since it is larger than the sum of its proper divisors (2207694031).
28063144889 is a wasteful number, since it uses less digits than its factorization.
28063144889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3499339.
The product of its (nonzero) digits is 2654208, while the sum is 53.
The spelling of 28063144889 in words is "twenty-eight billion, sixty-three million, one hundred forty-four thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •