Base | Representation |
---|---|
bin | 110011010100… |
… | …0100110001001 |
3 | 1212121220200100 |
4 | 1212220212021 |
5 | 23341424334 |
6 | 2400400013 |
7 | 444455100 |
oct | 146504611 |
9 | 55556610 |
10 | 26904969 |
11 | 14207113 |
12 | 9016009 |
13 | 5760300 |
14 | 3805037 |
15 | 2566c99 |
hex | 19a8989 |
26904969 has 81 divisors (see below), whose sum is σ = 51664743. Its totient is φ = 13444704.
The previous prime is 26904959. The next prime is 26905037. The reversal of 26904969 is 96940962.
26904969 = 643 + 653 + ... + 1053.
The square root of 26904969 is 5187.
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., 3980025 + 22924944 = 1995^2 + 4788^2 .
It is not a de Polignac number, because 26904969 - 25 = 26904937 is a prime.
It is a super-2 number, since 2×269049692 = 1447754713781922, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (26904919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 1416042 + ... + 1416060.
Almost surely, 226904969 is an apocalyptic number.
26904969 is the 5187-th square number.
26904969 is the 2594-th centered octagonal number.
It is an amenable number.
26904969 is a deficient number, since it is larger than the sum of its proper divisors (24759774).
26904969 is a wasteful number, since it uses less digits than its factorization.
26904969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84 (or 42 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The cubic root of 26904969 is about 299.6476195889.
The spelling of 26904969 in words is "twenty-six million, nine hundred four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •