Base | Representation |
---|---|
bin | 10000010101000… |
… | …10011000101101 |
3 | 100112202022020211 |
4 | 20022202120231 |
5 | 240031330023 |
6 | 21331542421 |
7 | 3252211432 |
oct | 1012423055 |
9 | 315668224 |
10 | 136980013 |
11 | 7035a125 |
12 | 39a5aa11 |
13 | 224c0881 |
14 | 14299b89 |
15 | c05ba0d |
hex | 82a262d |
136980013 has 4 divisors (see below), whose sum is σ = 137689948. Its totient is φ = 136270080.
The previous prime is 136980007. The next prime is 136980017. The reversal of 136980013 is 310089631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79174404 + 57805609 = 8898^2 + 7603^2 .
It is a cyclic number.
It is not a de Polignac number, because 136980013 - 29 = 136979501 is a prime.
It is a super-2 number, since 2×1369800132 = 37527047922960338, 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 (136980017) 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 3 ways as a sum of consecutive naturals, for example, 354678 + ... + 355063.
It is an arithmetic number, because the mean of its divisors is an integer number (34422487).
Almost surely, 2136980013 is an apocalyptic number.
It is an amenable number.
136980013 is a deficient number, since it is larger than the sum of its proper divisors (709935).
136980013 is an equidigital number, since it uses as much as digits as its factorization.
136980013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709934.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 136980013 is about 11703.8460772517. The cubic root of 136980013 is about 515.4886028106.
The spelling of 136980013 in words is "one hundred thirty-six million, nine hundred eighty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •