Base | Representation |
---|---|
bin | 10000010010101… |
… | …11000000100101 |
3 | 100112011121201212 |
4 | 20021113000211 |
5 | 234441440034 |
6 | 21321201205 |
7 | 3246454340 |
oct | 1011270045 |
9 | 315147655 |
10 | 136671269 |
11 | 70169169 |
12 | 39930205 |
13 | 22413197 |
14 | 14219457 |
15 | beea2ce |
hex | 8257025 |
136671269 has 4 divisors (see below), whose sum is σ = 156195744. Its totient is φ = 117146796.
The previous prime is 136671263. The next prime is 136671277. The reversal of 136671269 is 962176631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 962176631 = 13 ⋅74013587.
It is a cyclic number.
It is not a de Polignac number, because 136671269 - 28 = 136671013 is a prime.
It is a super-2 number, since 2×1366712692 = 37358071540140722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136671263) 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, 9762227 + ... + 9762240.
It is an arithmetic number, because the mean of its divisors is an integer number (39048936).
Almost surely, 2136671269 is an apocalyptic number.
It is an amenable number.
136671269 is a deficient number, since it is larger than the sum of its proper divisors (19524475).
136671269 is an equidigital number, since it uses as much as digits as its factorization.
136671269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19524474.
The product of its digits is 81648, while the sum is 41.
The square root of 136671269 is about 11690.6487843917. The cubic root of 136671269 is about 515.1010189242.
The spelling of 136671269 in words is "one hundred thirty-six million, six hundred seventy-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •