Base | Representation |
---|---|
bin | 11001000000100111… |
… | …011100000000000000 |
3 | 2120022111022122102202 |
4 | 121000213130000000 |
5 | 414444043241104 |
6 | 20200403532332 |
7 | 1640315150501 |
oct | 310047340000 |
9 | 76274278382 |
10 | 26853883904 |
11 | 10430354491 |
12 | 525538a0a8 |
13 | 26bc641743 |
14 | 142a688ba8 |
15 | a7282151e |
hex | 6409dc000 |
26853883904 has 120 divisors (see below), whose sum is σ = 56193570048. Its totient is φ = 12819824640.
The previous prime is 26853883897. The next prime is 26853883919. The reversal of 26853883904 is 40938835862.
It is a super-2 number, since 2×268538839042 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) 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 26853883904.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33111659 + ... + 33112469.
Almost surely, 226853883904 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26853883904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28096785024).
26853883904 is an abundant number, since it is smaller than the sum of its proper divisors (29339686144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26853883904 is an frugal number, since it uses more digits than its factorization.
26853883904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 929 (or 903 counting only the distinct ones).
The product of its (nonzero) digits is 9953280, while the sum is 56.
The spelling of 26853883904 in words is "twenty-six billion, eight hundred fifty-three million, eight hundred eighty-three thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •