Base | Representation |
---|---|
bin | 10000001110101… |
… | …11000111101010 |
3 | 100111012000011120 |
4 | 20013113013222 |
5 | 234323204214 |
6 | 21302040110 |
7 | 3242143203 |
oct | 1007270752 |
9 | 314160146 |
10 | 136147434 |
11 | 6a940645 |
12 | 39719036 |
13 | 2228b917 |
14 | 141205aa |
15 | be44ea9 |
hex | 81d71ea |
136147434 has 8 divisors (see below), whose sum is σ = 272294880. Its totient is φ = 45382476.
The previous prime is 136147433. The next prime is 136147447. The reversal of 136147434 is 434741631.
136147434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
136147434 is an admirable number.
It is a super-2 number, since 2×1361474342 = 37072247569568712, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136147395 and 136147404.
It is not an unprimeable number, because it can be changed into a prime (136147433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11345614 + ... + 11345625.
It is an arithmetic number, because the mean of its divisors is an integer number (34036860).
Almost surely, 2136147434 is an apocalyptic number.
136147434 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136147434 is a wasteful number, since it uses less digits than its factorization.
136147434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22691244.
The product of its digits is 24192, while the sum is 33.
The square root of 136147434 is about 11668.2232580629. The cubic root of 136147434 is about 514.4420815747.
The spelling of 136147434 in words is "one hundred thirty-six million, one hundred forty-seven thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •