Base | Representation |
---|---|
bin | 11001000110111001… |
… | …101110011011000001 |
3 | 2120120211202102201100 |
4 | 121012321232123001 |
5 | 420203042404444 |
6 | 20215052125013 |
7 | 1643035422351 |
oct | 310671563301 |
9 | 76524672640 |
10 | 26959341249 |
11 | 10484933115 |
12 | 5284766769 |
13 | 2708446239 |
14 | 143a69ab61 |
15 | a7bc02e69 |
hex | 646e6e6c1 |
26959341249 has 27 divisors (see below), whose sum is σ = 39276396003. Its totient is φ = 17819537904.
The previous prime is 26959341229. The next prime is 26959341257. The reversal of 26959341249 is 94214395962.
The square root of 26959341249 is 164193.
It is a perfect power (a square), and thus also a powerful number.
26959341249 is a `hidden beast` number, since 2 + 6 + 9 + 59 + 341 + 249 = 666.
It can be written as a sum of positive squares in only one way, i.e., 25108620849 + 1850720400 = 158457^2 + 43020^2 .
It is not a de Polignac number, because 26959341249 - 27 = 26959341121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26959341195 and 26959341204.
It is not an unprimeable number, because it can be changed into a prime (26959341229) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 112800472 + ... + 112800710.
Almost surely, 226959341249 is an apocalyptic number.
26959341249 is the 164193-rd square number.
26959341249 is the 82097-th centered octagonal number.
It is an amenable number.
26959341249 is a deficient number, since it is larger than the sum of its proper divisors (12317054754).
26959341249 is an frugal number, since it uses more digits than its factorization.
26959341249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942 (or 471 counting only the distinct ones).
The product of its digits is 4199040, while the sum is 54.
The spelling of 26959341249 in words is "twenty-six billion, nine hundred fifty-nine million, three hundred forty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •