Base | Representation |
---|---|
bin | 1100001000101100101010… |
… | …11111000000010011110000 |
3 | 10111111021011122122201010121 |
4 | 12010112111133000103300 |
5 | 11444220230233233320 |
6 | 132431522554340024 |
7 | 5423040126001624 |
oct | 604262537002360 |
9 | 114437148581117 |
10 | 26687139742960 |
11 | 8559a5271a684 |
12 | 2bb019112a614 |
13 | 11b77816590c8 |
14 | 6839433a1184 |
15 | 3142d8d798aa |
hex | 1845957c04f0 |
26687139742960 has 40 divisors (see below), whose sum is σ = 62049813464016. Its totient is φ = 10674475069440.
The previous prime is 26687139742943. The next prime is 26687139742973. The reversal of 26687139742960 is 6924793178662.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 26687139742960.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3688626 + ... + 8184145.
Almost surely, 226687139742960 is an apocalyptic number.
26687139742960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26687139742960 is an abundant number, since it is smaller than the sum of its proper divisors (35362673721056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26687139742960 is a wasteful number, since it uses less digits than its factorization.
26687139742960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11900881 (or 11900875 counting only the distinct ones).
The product of its (nonzero) digits is 329204736, while the sum is 70.
The spelling of 26687139742960 in words is "twenty-six trillion, six hundred eighty-seven billion, one hundred thirty-nine million, seven hundred forty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •