Base | Representation |
---|---|
bin | 11000011101000000… |
… | …000101000111100000 |
3 | 2111202211222111012221 |
4 | 120131000011013200 |
5 | 412233112122000 |
6 | 20021221000424 |
7 | 1616441261116 |
oct | 303500050740 |
9 | 74684874187 |
10 | 26256364000 |
11 | 1015403a989 |
12 | 5109253114 |
13 | 2625903979 |
14 | 13b1189ab6 |
15 | a3a14361a |
hex | 61d0051e0 |
26256364000 has 192 divisors, whose sum is σ = 69001051392. Its totient is φ = 9784320000.
The previous prime is 26256363979. The next prime is 26256364003. The reversal of 26256364000 is 46365262.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26256364003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6866089 + ... + 6869911.
It is an arithmetic number, because the mean of its divisors is an integer number (359380476).
Almost surely, 226256364000 is an apocalyptic number.
26256364000 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 26256364000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34500525696).
26256364000 is an abundant number, since it is smaller than the sum of its proper divisors (42744687392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26256364000 is a wasteful number, since it uses less digits than its factorization.
26256364000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3966 (or 3948 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 34.
The spelling of 26256364000 in words is "twenty-six billion, two hundred fifty-six million, three hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •