Base | Representation |
---|---|
bin | 11000101001110001… |
… | …110101001111010000 |
3 | 2112022210100112212100 |
4 | 120221301311033100 |
5 | 413203001422002 |
6 | 20054355400400 |
7 | 1624653341652 |
oct | 305161651720 |
9 | 75283315770 |
10 | 26470732752 |
11 | 10254047342 |
12 | 5168bb3100 |
13 | 265b14c199 |
14 | 13d182c6d2 |
15 | a4dd8a11c |
hex | 629c753d0 |
26470732752 has 120 divisors (see below), whose sum is σ = 79968096000. Its totient is φ = 8148881664.
The previous prime is 26470732747. The next prime is 26470732777. The reversal of 26470732752 is 25723707462.
It is a junction number, because it is equal to n+sod(n) for n = 26470732698 and 26470732707.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41752 + ... + 233847.
It is an arithmetic number, because the mean of its divisors is an integer number (666400800).
Almost surely, 226470732752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26470732752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39984048000).
26470732752 is an abundant number, since it is smaller than the sum of its proper divisors (53497363248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26470732752 is a wasteful number, since it uses less digits than its factorization.
26470732752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275665 (or 275656 counting only the distinct ones).
The product of its (nonzero) digits is 987840, while the sum is 45.
The spelling of 26470732752 in words is "twenty-six billion, four hundred seventy million, seven hundred thirty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •