Base | Representation |
---|---|
bin | 1011111100100001001010… |
… | …10101100110111111110000 |
3 | 10110000020222010121101101202 |
4 | 11332100211111212333300 |
5 | 11420341141434412310 |
6 | 131511352145550332 |
7 | 5350563355214003 |
oct | 576204525467760 |
9 | 113006863541352 |
10 | 26268646404080 |
11 | 840851a089043 |
12 | 2b430586453a8 |
13 | 11871798282c2 |
14 | 66b5a307153a |
15 | 308493b283a5 |
hex | 17e425566ff0 |
26268646404080 has 20 divisors (see below), whose sum is σ = 61074602889672. Its totient is φ = 10507458561600.
The previous prime is 26268646404079. The next prime is 26268646404101. The reversal of 26268646404080 is 8040464686262.
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×262686464040802 (a number of 28 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 congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 164179039946 + ... + 164179040105.
Almost surely, 226268646404080 is an apocalyptic number.
26268646404080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26268646404080 is an abundant number, since it is smaller than the sum of its proper divisors (34805956485592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26268646404080 is a wasteful number, since it uses less digits than its factorization.
26268646404080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328358080064 (or 328358080058 counting only the distinct ones).
The product of its (nonzero) digits is 21233664, while the sum is 56.
The spelling of 26268646404080 in words is "twenty-six trillion, two hundred sixty-eight billion, six hundred forty-six million, four hundred four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •