Base | Representation |
---|---|
bin | 11000110101101001… |
… | …110100100110000000 |
3 | 2112211200020022122201 |
4 | 120311221310212000 |
5 | 414110002201202 |
6 | 20130233442544 |
7 | 1632622626055 |
oct | 306551644600 |
9 | 75750208581 |
10 | 26669959552 |
11 | 10346551395 |
12 | 5203870454 |
13 | 26904c5572 |
14 | 141008d02c |
15 | a615e0387 |
hex | 635a74980 |
26669959552 has 64 divisors (see below), whose sum is σ = 54632199600. Its totient is φ = 12962985984.
The previous prime is 26669959549. The next prime is 26669959553. The reversal of 26669959552 is 25595996662.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×266699595522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26669959553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 721423 + ... + 757489.
Almost surely, 226669959552 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 26669959552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27316099800).
26669959552 is an abundant number, since it is smaller than the sum of its proper divisors (27962240048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26669959552 is a wasteful number, since it uses less digits than its factorization.
26669959552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36243 (or 36231 counting only the distinct ones).
The product of its digits is 78732000, while the sum is 64.
The spelling of 26669959552 in words is "twenty-six billion, six hundred sixty-nine million, nine hundred fifty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •