Base | Representation |
---|---|
bin | 10000010010111… |
… | …10110100100101 |
3 | 100112020020122001 |
4 | 20021132310211 |
5 | 234444001034 |
6 | 21322005301 |
7 | 3246646543 |
oct | 1011366445 |
9 | 315206561 |
10 | 136703269 |
11 | 7019020a |
12 | 39946831 |
13 | 22424911 |
14 | 14226d93 |
15 | c004a14 |
hex | 825ed25 |
136703269 has 2 divisors, whose sum is σ = 136703270. Its totient is φ = 136703268.
The previous prime is 136703267. The next prime is 136703293. The reversal of 136703269 is 962307631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94284100 + 42419169 = 9710^2 + 6513^2 .
It is an emirp because it is prime and its reverse (962307631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136703269 - 21 = 136703267 is a prime.
It is a super-2 number, since 2×1367032692 = 37375567510572722, which contains 22 as substring.
Together with 136703267, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136703261) by changing a digit.
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 as a sum of consecutive naturals, namely, 68351634 + 68351635.
It is an arithmetic number, because the mean of its divisors is an integer number (68351635).
Almost surely, 2136703269 is an apocalyptic number.
It is an amenable number.
136703269 is a deficient number, since it is larger than the sum of its proper divisors (1).
136703269 is an equidigital number, since it uses as much as digits as its factorization.
136703269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 37.
The square root of 136703269 is about 11692.0173195219. The cubic root of 136703269 is about 515.1412174396.
The spelling of 136703269 in words is "one hundred thirty-six million, seven hundred three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •