Base | Representation |
---|---|
bin | 10000010100100… |
… | …00000010100101 |
3 | 100112121111011201 |
4 | 20022100002211 |
5 | 240021423434 |
6 | 21330202501 |
7 | 3251446363 |
oct | 1012200245 |
9 | 315544151 |
10 | 136904869 |
11 | 70308722 |
12 | 39a23431 |
13 | 224955ca |
14 | 1427a633 |
15 | c044614 |
hex | 82900a5 |
136904869 has 4 divisors (see below), whose sum is σ = 137039980. Its totient is φ = 136769760.
The previous prime is 136904851. The next prime is 136904891. The reversal of 136904869 is 968409631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 968409631 = 7 ⋅138344233.
It can be written as a sum of positive squares in 2 ways, for example, as 101263969 + 35640900 = 10063^2 + 5970^2 .
It is a cyclic number.
It is not a de Polignac number, because 136904869 - 25 = 136904837 is a prime.
It is a super-2 number, since 2×1369048692 = 37485886311814322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136904269) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66024 + ... + 68065.
It is an arithmetic number, because the mean of its divisors is an integer number (34259995).
Almost surely, 2136904869 is an apocalyptic number.
It is an amenable number.
136904869 is a deficient number, since it is larger than the sum of its proper divisors (135111).
136904869 is a wasteful number, since it uses less digits than its factorization.
136904869 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135110.
The product of its (nonzero) digits is 279936, while the sum is 46.
The square root of 136904869 is about 11700.6354100963. The cubic root of 136904869 is about 515.3943239445.
The spelling of 136904869 in words is "one hundred thirty-six million, nine hundred four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •