Base | Representation |
---|---|
bin | 11001000110010001… |
… | …111001111100000000 |
3 | 2120120010010002122210 |
4 | 121012101321330000 |
5 | 420142404341111 |
6 | 20214040302120 |
7 | 1642550615214 |
oct | 310621717400 |
9 | 76503102583 |
10 | 26948902656 |
11 | 10479a53485 |
12 | 5281171940 |
13 | 270622cb60 |
14 | 1439140944 |
15 | a7ad400a6 |
hex | 646479f00 |
26948902656 has 144 divisors (see below), whose sum is σ = 81784642464. Its totient is φ = 7804157952.
The previous prime is 26948902627. The next prime is 26948902727. The reversal of 26948902656 is 65620984962.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 26948902596 and 26948902605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90340 + ... + 249116.
It is an arithmetic number, because the mean of its divisors is an integer number (567948906).
Almost surely, 226948902656 is an apocalyptic number.
26948902656 is a gapful number since it is divisible by the number (26) 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 26948902656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40892321232).
26948902656 is an abundant number, since it is smaller than the sum of its proper divisors (54835739808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26948902656 is a wasteful number, since it uses less digits than its factorization.
26948902656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158826 (or 158812 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 57.
The spelling of 26948902656 in words is "twenty-six billion, nine hundred forty-eight million, nine hundred two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •