Base | Representation |
---|---|
bin | 11000101100011111… |
… | …011111100000110000 |
3 | 2112102222000102010210 |
4 | 120230133133200300 |
5 | 413301130204231 |
6 | 20103103224120 |
7 | 1626045315120 |
oct | 305437374060 |
9 | 75388012123 |
10 | 26516256816 |
11 | 10277810235 |
12 | 51802a8040 |
13 | 26676cb1ba |
14 | 13d78bcc80 |
15 | a52d7da46 |
hex | 62c7df830 |
26516256816 has 160 divisors (see below), whose sum is σ = 82565429760. Its totient is φ = 7163486208.
The previous prime is 26516256803. The next prime is 26516256817. The reversal of 26516256816 is 61865261562.
It is a super-2 number, since 2×265162568162 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (26516256817) 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, 3552160 + ... + 3559616.
It is an arithmetic number, because the mean of its divisors is an integer number (516033936).
Almost surely, 226516256816 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 26516256816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41282714880).
26516256816 is an abundant number, since it is smaller than the sum of its proper divisors (56049172944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26516256816 is a wasteful number, since it uses less digits than its factorization.
26516256816 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8051 (or 8045 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 48.
The spelling of 26516256816 in words is "twenty-six billion, five hundred sixteen million, two hundred fifty-six thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •