Base | Representation |
---|---|
bin | 11000011000110000… |
… | …011101000110010000 |
3 | 2111120212222220101210 |
4 | 120120300131012100 |
5 | 412111400042211 |
6 | 20010154500120 |
7 | 1614615115410 |
oct | 303060350620 |
9 | 74525886353 |
10 | 26185159056 |
11 | 10117926621 |
12 | 50a9434640 |
13 | 2613c32874 |
14 | 13a5932640 |
15 | a33c7a9a6 |
hex | 618c1d190 |
26185159056 has 160 divisors (see below), whose sum is σ = 79330922496. Its totient is φ = 7286400000.
The previous prime is 26185159027. The next prime is 26185159069. The reversal of 26185159056 is 65095158162.
It is a super-2 number, since 2×261851590562 (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 a junction number, because it is equal to n+sod(n) for n = 26185158996 and 26185159014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10344511 + ... + 10347041.
Almost surely, 226185159056 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 26185159056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39665461248).
26185159056 is an abundant number, since it is smaller than the sum of its proper divisors (53145763440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26185159056 is a wasteful number, since it uses less digits than its factorization.
26185159056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3341 (or 3335 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 48.
The spelling of 26185159056 in words is "twenty-six billion, one hundred eighty-five million, one hundred fifty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •