Base | Representation |
---|---|
bin | 11000111101111100… |
… | …010001000000000000 |
3 | 2120012100212221001200 |
4 | 120331330101000000 |
5 | 414401101342344 |
6 | 20152122101200 |
7 | 1636231562331 |
oct | 307574210000 |
9 | 76170787050 |
10 | 26809012224 |
11 | 10407a96755 |
12 | 524234a800 |
13 | 26b3260657 |
14 | 1424728288 |
15 | a6d90b069 |
hex | 63df11000 |
26809012224 has 78 divisors (see below), whose sum is σ = 77438909886. Its totient is φ = 8936325120.
The previous prime is 26809012211. The next prime is 26809012229. The reversal of 26809012224 is 42221090862.
It can be written as a sum of positive squares in only one way, i.e., 25334452224 + 1474560000 = 159168^2 + 38400^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (26809012229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 326757 + ... + 400484.
It is an arithmetic number, because the mean of its divisors is an integer number (992806537).
Almost surely, 226809012224 is an apocalyptic number.
26809012224 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
26809012224 is an abundant number, since it is smaller than the sum of its proper divisors (50629897662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26809012224 is an equidigital number, since it uses as much as digits as its factorization.
26809012224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727271 (or 727246 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 26809012224 in words is "twenty-six billion, eight hundred nine million, twelve thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •