Base | Representation |
---|---|
bin | 11000010100000001… |
… | …111111111100011000 |
3 | 2111101100210201012210 |
4 | 120110001333330120 |
5 | 411431100402102 |
6 | 15554243235120 |
7 | 1612633152303 |
oct | 302401777430 |
9 | 74340721183 |
10 | 26105872152 |
11 | 100870a2158 |
12 | 5086978aa0 |
13 | 2600691c39 |
14 | 13991b3b3a |
15 | a2bd1836c |
hex | 61407ff18 |
26105872152 has 64 divisors (see below), whose sum is σ = 67716136800. Its totient is φ = 8376883200.
The previous prime is 26105872097. The next prime is 26105872217. The reversal of 26105872152 is 25127850162.
It is a super-2 number, since 2×261058721522 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 26105872152.
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 15 ways as a sum of consecutive naturals, for example, 178902 + ... + 290202.
Almost surely, 226105872152 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 26105872152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33858068400).
26105872152 is an abundant number, since it is smaller than the sum of its proper divisors (41610264648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26105872152 is a wasteful number, since it uses less digits than its factorization.
26105872152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111676 (or 111672 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 39.
The spelling of 26105872152 in words is "twenty-six billion, one hundred five million, eight hundred seventy-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •