Base | Representation |
---|---|
bin | 10000001111110… |
… | …11000100111000 |
3 | 100111110111012022 |
4 | 20013323010320 |
5 | 234342412322 |
6 | 21305134012 |
7 | 3243325451 |
oct | 1007730470 |
9 | 314414168 |
10 | 136294712 |
11 | 6aa31264 |
12 | 3978a308 |
13 | 22310978 |
14 | 1415c128 |
15 | be73942 |
hex | 81fb138 |
136294712 has 48 divisors (see below), whose sum is σ = 273868560. Its totient is φ = 63574016.
The previous prime is 136294703. The next prime is 136294721. The reversal of 136294712 is 217492631.
It is an interprime number because it is at equal distance from previous prime (136294703) and next prime (136294721).
It is a super-3 number, since 3×1362947123 (a number of 25 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 385928 + ... + 386280.
It is an arithmetic number, because the mean of its divisors is an integer number (5705595).
Almost surely, 2136294712 is an apocalyptic number.
It is an amenable number.
136294712 is an abundant number, since it is smaller than the sum of its proper divisors (137573848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136294712 is a wasteful number, since it uses less digits than its factorization.
136294712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560 (or 539 counting only the distinct ones).
The product of its digits is 18144, while the sum is 35.
The square root of 136294712 is about 11674.5326244779. The cubic root of 136294712 is about 514.6275146135.
The spelling of 136294712 in words is "one hundred thirty-six million, two hundred ninety-four thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •