Base | Representation |
---|---|
bin | 10000010010101… |
… | …00010001000000 |
3 | 100112011001022200 |
4 | 20021110101000 |
5 | 234441110112 |
6 | 21321033200 |
7 | 3246406515 |
oct | 1011242100 |
9 | 315131280 |
10 | 136660032 |
11 | 70160783 |
12 | 39925800 |
13 | 2240b032 |
14 | 1421530c |
15 | bee6cdc |
hex | 8254440 |
136660032 has 42 divisors (see below), whose sum is σ = 391712958. Its totient is φ = 45553152.
The previous prime is 136660009. The next prime is 136660033. The reversal of 136660032 is 230066631.
It can be written as a sum of positive squares in only one way, i.e., 117158976 + 19501056 = 10824^2 + 4416^2 .
It is a junction number, because it is equal to n+sod(n) for n = 136659978 and 136660005.
It is not an unprimeable number, because it can be changed into a prime (136660033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 118053 + ... + 119204.
It is an arithmetic number, because the mean of its divisors is an integer number (9326499).
Almost surely, 2136660032 is an apocalyptic number.
136660032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136660032 is an abundant number, since it is smaller than the sum of its proper divisors (255052926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136660032 is a wasteful number, since it uses less digits than its factorization.
136660032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237275 (or 237262 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 136660032 is about 11690.1681767201. The cubic root of 136660032 is about 515.0869014757.
The spelling of 136660032 in words is "one hundred thirty-six million, six hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •