Base | Representation |
---|---|
bin | 1011110110001101101010… |
… | …11101010010110110011000 |
3 | 10102020112211010200221211112 |
4 | 11323012311131102312120 |
5 | 11403314014334140340 |
6 | 131224044435515452 |
7 | 5326124236545563 |
oct | 573066535226630 |
9 | 112215733627745 |
10 | 26052021005720 |
11 | 8334666756aa6 |
12 | 2b09081158b88 |
13 | 116c906003a08 |
14 | 660cd2d434da |
15 | 302a15d25065 |
hex | 17b1b5752d98 |
26052021005720 has 64 divisors (see below), whose sum is σ = 59704502803200. Its totient is φ = 10228776127360.
The previous prime is 26052021005711. The next prime is 26052021005723. The reversal of 26052021005720 is 2750012025062.
It is a super-3 number, since 3×260520210057203 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26052021005723) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19560710 + ... + 20850069.
It is an arithmetic number, because the mean of its divisors is an integer number (932882856300).
Almost surely, 226052021005720 is an apocalyptic number.
26052021005720 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26052021005720 is an abundant number, since it is smaller than the sum of its proper divisors (33652481797480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26052021005720 is a wasteful number, since it uses less digits than its factorization.
26052021005720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40411088 (or 40411084 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 32.
The spelling of 26052021005720 in words is "twenty-six trillion, fifty-two billion, twenty-one million, five thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •