Base | Representation |
---|---|
bin | 1100110001001001000101… |
… | …10111111100101110110000 |
3 | 10200102010002111211102002010 |
4 | 12120210202313330232300 |
5 | 12140002224243242333 |
6 | 135414144135122520 |
7 | 5625323636616321 |
oct | 630444267745660 |
9 | 120363074742063 |
10 | 28076786305968 |
11 | 8a45330a00474 |
12 | 3195576b13440 |
13 | 12888252880aa |
14 | 6d0cd0924448 |
15 | 33a51d0b4563 |
hex | 198922dfcbb0 |
28076786305968 has 80 divisors (see below), whose sum is σ = 72980247338240. Its totient is φ = 9301057051392.
The previous prime is 28076786305913. The next prime is 28076786305987. The reversal of 28076786305968 is 86950368767082.
It is a super-2 number, since 2×280767863059682 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28076786305968.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184750398 + ... + 184902306.
It is an arithmetic number, because the mean of its divisors is an integer number (912253091728).
Almost surely, 228076786305968 is an apocalyptic number.
It is an amenable number.
28076786305968 is an abundant number, since it is smaller than the sum of its proper divisors (44903461032272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28076786305968 is a wasteful number, since it uses less digits than its factorization.
28076786305968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175706 (or 175700 counting only the distinct ones).
The product of its (nonzero) digits is 1463132160, while the sum is 75.
The spelling of 28076786305968 in words is "twenty-eight trillion, seventy-six billion, seven hundred eighty-six million, three hundred five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •