Base | Representation |
---|---|
bin | 1100001100011110010010… |
… | …00000100000001011100000 |
3 | 10111221122222121101002212010 |
4 | 12012033021000200023200 |
5 | 12003331403403244102 |
6 | 133011254155432520 |
7 | 5435311423016046 |
oct | 606171100401340 |
9 | 114848877332763 |
10 | 26816853181152 |
11 | 85a9a66563671 |
12 | 3011351a55740 |
13 | 11c6a84059628 |
14 | 689d2a794396 |
15 | 31787b985d6c |
hex | 1863c90202e0 |
26816853181152 has 48 divisors (see below), whose sum is σ = 70457260687632. Its totient is φ = 8930948382720.
The previous prime is 26816853181087. The next prime is 26816853181169. The reversal of 26816853181152 is 25118135861862.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×268168531811522 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26816853181092 and 26816853181101.
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, 124934049 + ... + 125148512.
It is an arithmetic number, because the mean of its divisors is an integer number (1467859597659).
Almost surely, 226816853181152 is an apocalyptic number.
It is an amenable number.
26816853181152 is an abundant number, since it is smaller than the sum of its proper divisors (43640407506480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26816853181152 is a wasteful number, since it uses less digits than its factorization.
26816853181152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250083691 (or 250083683 counting only the distinct ones).
The product of its digits is 5529600, while the sum is 57.
The spelling of 26816853181152 in words is "twenty-six trillion, eight hundred sixteen billion, eight hundred fifty-three million, one hundred eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •