Base | Representation |
---|---|
bin | 1101000000110101101001… |
… | …11011001010111011001100 |
3 | 10202022200011201212120120111 |
4 | 12200122310323022323030 |
5 | 12222321242012123301 |
6 | 140510020332525404 |
7 | 6012305551466554 |
oct | 640326473127314 |
9 | 122280151776514 |
10 | 28616107536076 |
11 | 9133028758055 |
12 | 3261bb0620864 |
13 | 12c7644970318 |
14 | 70d054106164 |
15 | 349585d02551 |
hex | 1a06b4ecaecc |
28616107536076 has 48 divisors (see below), whose sum is σ = 52230828633984. Its totient is φ = 13707635711616.
The previous prime is 28616107536019. The next prime is 28616107536101. The reversal of 28616107536076 is 67063570161682.
It is a super-2 number, since 2×286161075360762 (a number of 28 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 28616107536076.
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, 2643610 + ... + 8013793.
It is an arithmetic number, because the mean of its divisors is an integer number (1088142263208).
Almost surely, 228616107536076 is an apocalyptic number.
It is an amenable number.
28616107536076 is a deficient number, since it is larger than the sum of its proper divisors (23614721097908).
28616107536076 is a wasteful number, since it uses less digits than its factorization.
28616107536076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10657750 (or 10657748 counting only the distinct ones).
The product of its (nonzero) digits is 15240960, while the sum is 58.
The spelling of 28616107536076 in words is "twenty-eight trillion, six hundred sixteen billion, one hundred seven million, five hundred thirty-six thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •