Base | Representation |
---|---|
bin | 11000010001101011… |
… | …101010010001001010 |
3 | 2111021121122110100000 |
4 | 120101223222101022 |
5 | 411341003234040 |
6 | 15550314423430 |
7 | 1611644161236 |
oct | 302153522112 |
9 | 74247573300 |
10 | 26066461770 |
11 | 10066924598 |
12 | 5075731b76 |
13 | 25c547389b |
14 | 1393c755c6 |
15 | a28631130 |
hex | 611aea44a |
26066461770 has 96 divisors (see below), whose sum is σ = 71008112448. Its totient is φ = 6879333888.
The previous prime is 26066461769. The next prime is 26066461807. The reversal of 26066461770 is 7716466062.
It is a happy number.
26066461770 is a `hidden beast` number, since 2 + 60 + 66 + 461 + 7 + 70 = 666.
It is a super-3 number, since 3×260664617703 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 180417 + ... + 291003.
It is an arithmetic number, because the mean of its divisors is an integer number (739667838).
Almost surely, 226066461770 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26066461770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35504056224).
26066461770 is an abundant number, since it is smaller than the sum of its proper divisors (44941650678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26066461770 is a wasteful number, since it uses less digits than its factorization.
26066461770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110706 (or 110694 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 45.
The spelling of 26066461770 in words is "twenty-six billion, sixty-six million, four hundred sixty-one thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •