Base | Representation |
---|---|
bin | 11001000011010010… |
… | …000110111001000000 |
3 | 2120102121111200101201 |
4 | 121003102012321000 |
5 | 420042021432224 |
6 | 20205042510544 |
7 | 1641400350334 |
oct | 310322067100 |
9 | 76377450351 |
10 | 26898624064 |
11 | 10453632424 |
12 | 5268365454 |
13 | 26c89a7a00 |
14 | 14325b37c4 |
15 | a7670ca44 |
hex | 643486e40 |
26898624064 has 189 divisors, whose sum is σ = 61744666833. Its totient is φ = 11619638784.
The previous prime is 26898624047. The next prime is 26898624107. The reversal of 26898624064 is 46042689862.
The square root of 26898624064 is 164008.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3979086400 + 22919537664 = 63080^2 + 151392^2 .
It is a junction number, because it is equal to n+sod(n) for n = 26898623996 and 26898624014.
It is an unprimeable number.
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 26 ways as a sum of consecutive naturals, for example, 324079767 + ... + 324079849.
Almost surely, 226898624064 is an apocalyptic number.
26898624064 is the 164008-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26898624064
26898624064 is an abundant number, since it is smaller than the sum of its proper divisors (34846042769).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26898624064 is an equidigital number, since it uses as much as digits as its factorization.
26898624064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 7962624, while the sum is 55.
The spelling of 26898624064 in words is "twenty-six billion, eight hundred ninety-eight million, six hundred twenty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •