Base | Representation |
---|---|
bin | 11000100100111000… |
… | …111101000010111100 |
3 | 2112010002000112211012 |
4 | 120210320331002330 |
5 | 413021002314120 |
6 | 20042305414352 |
7 | 1622636236151 |
oct | 304470750274 |
9 | 75102015735 |
10 | 26388713660 |
11 | 10211817171 |
12 | 514563a3b8 |
13 | 2647162a8a |
14 | 13c499c228 |
15 | a46a881c5 |
hex | 624e3d0bc |
26388713660 has 12 divisors (see below), whose sum is σ = 55416298728. Its totient is φ = 10555485456.
The previous prime is 26388713651. The next prime is 26388713707. The reversal of 26388713660 is 6631788362.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 26388713599 and 26388713608.
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 3 ways as a sum of consecutive naturals, for example, 659717822 + ... + 659717861.
It is an arithmetic number, because the mean of its divisors is an integer number (4618024894).
Almost surely, 226388713660 is an apocalyptic number.
26388713660 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26388713660 is an abundant number, since it is smaller than the sum of its proper divisors (29027585068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26388713660 is a wasteful number, since it uses less digits than its factorization.
26388713660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319435692 (or 1319435690 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 50.
The spelling of 26388713660 in words is "twenty-six billion, three hundred eighty-eight million, seven hundred thirteen thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •