Base | Representation |
---|---|
bin | 10000010101001… |
… | …00101101110000 |
3 | 100112202210100010 |
4 | 20022210231300 |
5 | 240032131202 |
6 | 21332054520 |
7 | 3252251310 |
oct | 1012445560 |
9 | 315683303 |
10 | 136989552 |
11 | 70366307 |
12 | 39a64440 |
13 | 224c500b |
14 | 1429d440 |
15 | c05e76c |
hex | 82a4b70 |
136989552 has 40 divisors (see below), whose sum is σ = 404446336. Its totient is φ = 39139776.
The previous prime is 136989551. The next prime is 136989571. The reversal of 136989552 is 255989631.
It is a happy number.
136989552 is nontrivially palindromic in base 11.
It is a super-2 number, since 2×1369895522 = 37532274714321408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136989551) 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 7 ways as a sum of consecutive naturals, for example, 203518 + ... + 204189.
Almost surely, 2136989552 is an apocalyptic number.
136989552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136989552 is an abundant number, since it is smaller than the sum of its proper divisors (267456784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136989552 is a wasteful number, since it uses less digits than its factorization.
136989552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407725 (or 407719 counting only the distinct ones).
The product of its digits is 583200, while the sum is 48.
The square root of 136989552 is about 11704.2535857696. The cubic root of 136989552 is about 515.5005683802.
The spelling of 136989552 in words is "one hundred thirty-six million, nine hundred eighty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •