Base | Representation |
---|---|
bin | 1100000000100000100001… |
… | …00001011011000101011000 |
3 | 10110111100211011010011200101 |
4 | 12000100100201123011120 |
5 | 11430112421422223302 |
6 | 132054343330345144 |
7 | 5363515520533561 |
oct | 600202041330530 |
9 | 113440734104611 |
10 | 26405736132952 |
11 | 8460678718430 |
12 | 2b6573772b1b4 |
13 | 1197086491477 |
14 | 674089d73168 |
15 | 30bd190cc287 |
hex | 18041085b158 |
26405736132952 has 64 divisors (see below), whose sum is σ = 57399923773440. Its totient is φ = 11254886668800.
The previous prime is 26405736132931. The next prime is 26405736132953. The reversal of 26405736132952 is 25923163750462.
It is a junction number, because it is equal to n+sod(n) for n = 26405736132893 and 26405736132902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26405736132953) 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, 32160808 + ... + 32971639.
It is an arithmetic number, because the mean of its divisors is an integer number (896873808960).
Almost surely, 226405736132952 is an apocalyptic number.
26405736132952 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
26405736132952 is an abundant number, since it is smaller than the sum of its proper divisors (30994187640488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26405736132952 is a wasteful number, since it uses less digits than its factorization.
26405736132952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65132752 (or 65132748 counting only the distinct ones).
The product of its (nonzero) digits is 16329600, while the sum is 55.
The spelling of 26405736132952 in words is "twenty-six trillion, four hundred five billion, seven hundred thirty-six million, one hundred thirty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •