Base | Representation |
---|---|
bin | 10000001110011… |
… | …00000101000100 |
3 | 100111002201010200 |
4 | 20013030011010 |
5 | 234320232322 |
6 | 21301050500 |
7 | 3241564311 |
oct | 1007140504 |
9 | 314081120 |
10 | 136102212 |
11 | 6a90a674 |
12 | 396b6a30 |
13 | 2227416c |
14 | 1410bd08 |
15 | be368ac |
hex | 81cc144 |
136102212 has 36 divisors (see below), whose sum is σ = 344433180. Its totient is φ = 45315072.
The previous prime is 136102199. The next prime is 136102223. The reversal of 136102212 is 212201631.
It can be written as a sum of positive squares in 2 ways, for example, as 92621376 + 43480836 = 9624^2 + 6594^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1361022122 = 37047624222585888, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41364 + ... + 44532.
Almost surely, 2136102212 is an apocalyptic number.
136102212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136102212 is an abundant number, since it is smaller than the sum of its proper divisors (208330968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136102212 is a wasteful number, since it uses less digits than its factorization.
136102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4372 (or 4367 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 136102212 is about 11666.2852699563. The cubic root of 136102212 is about 514.3851171615.
Adding to 136102212 its reverse (212201631), we get a palindrome (348303843).
The spelling of 136102212 in words is "one hundred thirty-six million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •