Base | Representation |
---|---|
bin | 1100000111101001000011… |
… | …10111100000001101100000 |
3 | 10111100210110212210101221201 |
4 | 12003310201313200031200 |
5 | 11443121410102112124 |
6 | 132403121010530544 |
7 | 5420313444400462 |
oct | 603644167401540 |
9 | 114323425711851 |
10 | 26650840269664 |
11 | 8545615601076 |
12 | 2ba5140596a54 |
13 | 11b4218153120 |
14 | 681c9c470132 |
15 | 3133b21b0144 |
hex | 183d21de0360 |
26650840269664 has 48 divisors (see below), whose sum is σ = 56573564497632. Its totient is φ = 12285441865728.
The previous prime is 26650840269661. The next prime is 26650840269671. The reversal of 26650840269664 is 46696204805662.
It is a junction number, because it is equal to n+sod(n) for n = 26650840269596 and 26650840269605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26650840269661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38578969 + ... + 39263704.
It is an arithmetic number, because the mean of its divisors is an integer number (1178615927034).
Almost surely, 226650840269664 is an apocalyptic number.
It is an amenable number.
26650840269664 is an abundant number, since it is smaller than the sum of its proper divisors (29922724227968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26650840269664 is a wasteful number, since it uses less digits than its factorization.
26650840269664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77843519 (or 77843511 counting only the distinct ones).
The product of its (nonzero) digits is 179159040, while the sum is 64.
The spelling of 26650840269664 in words is "twenty-six trillion, six hundred fifty billion, eight hundred forty million, two hundred sixty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •