Base | Representation |
---|---|
bin | 10000010010001… |
… | …11001000010110 |
3 | 100112001022112000 |
4 | 20021013020112 |
5 | 234432344410 |
6 | 21315540130 |
7 | 3246063615 |
oct | 1011071026 |
9 | 315038460 |
10 | 136606230 |
11 | 70124312 |
12 | 398ba646 |
13 | 223bc6b7 |
14 | 141dd87c |
15 | bed5dc0 |
hex | 8247216 |
136606230 has 32 divisors (see below), whose sum is σ = 364284000. Its totient is φ = 36428256.
The previous prime is 136606207. The next prime is 136606241. The reversal of 136606230 is 32606631.
136606230 is a `hidden beast` number, since 1 + 36 + 6 + 0 + 623 + 0 = 666.
It is a super-2 number, since 2×1366062302 = 37322524149625800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 136606194 and 136606203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252705 + ... + 253244.
It is an arithmetic number, because the mean of its divisors is an integer number (11383875).
Almost surely, 2136606230 is an apocalyptic number.
136606230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136606230 is an abundant number, since it is smaller than the sum of its proper divisors (227677770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136606230 is a wasteful number, since it uses less digits than its factorization.
136606230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 505965 (or 505959 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 136606230 is about 11687.8667856885. The cubic root of 136606230 is about 515.0192973572.
The spelling of 136606230 in words is "one hundred thirty-six million, six hundred six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •