Base | Representation |
---|---|
bin | 10000001101110… |
… | …01100011001000 |
3 | 100110221212000120 |
4 | 20012321203020 |
5 | 234310320222 |
6 | 21255303240 |
7 | 3241130112 |
oct | 1006714310 |
9 | 313855016 |
10 | 136026312 |
11 | 6a868644 |
12 | 3967ab20 |
13 | 22248756 |
14 | 140cc3b2 |
15 | be1e15c |
hex | 81b98c8 |
136026312 has 32 divisors (see below), whose sum is σ = 340385280. Its totient is φ = 45299520.
The previous prime is 136026307. The next prime is 136026323. The reversal of 136026312 is 213620631.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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, 33378 + ... + 37230.
It is an arithmetic number, because the mean of its divisors is an integer number (10637040).
Almost surely, 2136026312 is an apocalyptic number.
136026312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136026312 is an abundant number, since it is smaller than the sum of its proper divisors (204358968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136026312 is a wasteful number, since it uses less digits than its factorization.
136026312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5333 (or 5329 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 136026312 is about 11663.0318528245. The cubic root of 136026312 is about 514.2894804839.
Adding to 136026312 its reverse (213620631), we get a palindrome (349646943).
It can be divided in two parts, 1360 and 26312, that added together give a palindrome (27672).
The spelling of 136026312 in words is "one hundred thirty-six million, twenty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •