Base | Representation |
---|---|
bin | 11010001011101100… |
… | …000101111110000010 |
3 | 2200120021022110122120 |
4 | 122023230011332002 |
5 | 430034012124321 |
6 | 20525355345110 |
7 | 2013450630303 |
oct | 321354057602 |
9 | 80507273576 |
10 | 28113395586 |
11 | 10a17308231 |
12 | 5547152196 |
13 | 2860571823 |
14 | 1509a6a7aa |
15 | ae81b4ec6 |
hex | 68bb05f82 |
28113395586 has 16 divisors (see below), whose sum is σ = 58165646400. Its totient is φ = 9047989328.
The previous prime is 28113395521. The next prime is 28113395617. The reversal of 28113395586 is 68559331182.
It is a happy number.
28113395586 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×281133955862 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80785446 + ... + 80785793.
It is an arithmetic number, because the mean of its divisors is an integer number (3635352900).
Almost surely, 228113395586 is an apocalyptic number.
28113395586 is an abundant number, since it is smaller than the sum of its proper divisors (30052250814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28113395586 is a wasteful number, since it uses less digits than its factorization.
28113395586 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161571273.
The product of its digits is 1555200, while the sum is 51.
The spelling of 28113395586 in words is "twenty-eight billion, one hundred thirteen million, three hundred ninety-five thousand, five hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •