Base | Representation |
---|---|
bin | 11000110101011110… |
… | …000111001100010000 |
3 | 2112211110110101000121 |
4 | 120311132013030100 |
5 | 414103210440000 |
6 | 20130044000024 |
7 | 1632554552662 |
oct | 306536071420 |
9 | 75743411017 |
10 | 26666890000 |
11 | 10344845173 |
12 | 5202830014 |
13 | 268c98c36a |
14 | 140d8d0532 |
15 | a611d5b1a |
hex | 635787310 |
26666890000 has 225 divisors, whose sum is σ = 68456336179. Its totient is φ = 10059280000.
The previous prime is 26666889959. The next prime is 26666890021. The reversal of 26666890000 is 9866662.
It is a happy number.
The square root of 26666890000 is 163300.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 2090684176 + 24576205824 = 45724^2 + 156768^2 .
It is a super-2 number, since 2×266668900002 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 375589965 + ... + 375590035.
Almost surely, 226666890000 is an apocalyptic number.
26666890000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
26666890000 is the 163300-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26666890000
26666890000 is an abundant number, since it is smaller than the sum of its proper divisors (41789446179).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26666890000 is an frugal number, since it uses more digits than its factorization.
26666890000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 43.
The spelling of 26666890000 in words is "twenty-six billion, six hundred sixty-six million, eight hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •