Base | Representation |
---|---|
bin | 11000011101111101… |
… | …111111001100000000 |
3 | 2111210222111222201200 |
4 | 120131331333030000 |
5 | 412301240431030 |
6 | 20023000501200 |
7 | 1620026232000 |
oct | 303575771400 |
9 | 74728458650 |
10 | 26272592640 |
11 | 10162214788 |
12 | 511277a800 |
13 | 2629096608 |
14 | 13b33b2000 |
15 | a3b79bd60 |
hex | 61df7f300 |
26272592640 has 864 divisors, whose sum is σ = 108732624000. Its totient is φ = 5852528640.
The previous prime is 26272592629. The next prime is 26272592641. The reversal of 26272592640 is 4629527262.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (26272592641) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 241032906 + ... + 241033014.
Almost surely, 226272592640 is an apocalyptic number.
26272592640 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 26272592640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54366312000).
26272592640 is an abundant number, since it is smaller than the sum of its proper divisors (82460031360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26272592640 is a wasteful number, since it uses less digits than its factorization.
26272592640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218 (or 187 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 26272592640 in words is "twenty-six billion, two hundred seventy-two million, five hundred ninety-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •