Base | Representation |
---|---|
bin | 11000111010111101… |
… | …101101101111101100 |
3 | 2120001212220010010100 |
4 | 120322331231233230 |
5 | 414300304413320 |
6 | 20143135311100 |
7 | 1635054155346 |
oct | 307275555754 |
9 | 76055803110 |
10 | 26759060460 |
11 | 10391879200 |
12 | 522967b490 |
13 | 26a5ac11b2 |
14 | 141bc44296 |
15 | a69340790 |
hex | 63af6dbec |
26759060460 has 216 divisors, whose sum is σ = 94468465728. Its totient is φ = 6105369600.
The previous prime is 26759060429. The next prime is 26759060483. The reversal of 26759060460 is 6406095762.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 334125 + ... + 406395.
It is an arithmetic number, because the mean of its divisors is an integer number (437354008).
Almost surely, 226759060460 is an apocalyptic number.
26759060460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26759060460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47234232864).
26759060460 is an abundant number, since it is smaller than the sum of its proper divisors (67709405268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26759060460 is a wasteful number, since it uses less digits than its factorization.
26759060460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72325 (or 72309 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 45.
The spelling of 26759060460 in words is "twenty-six billion, seven hundred fifty-nine million, sixty thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •