Base | Representation |
---|---|
bin | 10000001101111… |
… | …00001011000010 |
3 | 100110222101202120 |
4 | 20012330023002 |
5 | 234311141213 |
6 | 21255425110 |
7 | 3241203333 |
oct | 1006741302 |
9 | 313871676 |
10 | 136037058 |
11 | 6a875723 |
12 | 39685196 |
13 | 22250601 |
14 | 140d228a |
15 | be22423 |
hex | 81bc2c2 |
136037058 has 8 divisors (see below), whose sum is σ = 272074128. Its totient is φ = 45345684.
The previous prime is 136037047. The next prime is 136037071. The reversal of 136037058 is 850730631.
It is a happy number.
136037058 is digitally balanced in base 3, 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.
136037058 is an admirable number.
It is a super-2 number, since 2×1360370582 = 37012162298590728, which contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 11336416 + ... + 11336427.
It is an arithmetic number, because the mean of its divisors is an integer number (34009266).
Almost surely, 2136037058 is an apocalyptic number.
136037058 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.
136037058 is a wasteful number, since it uses less digits than its factorization.
136037058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22672848.
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 136037058 is about 11663.4925301129. The cubic root of 136037058 is about 514.3030229845.
Adding to 136037058 its reverse (850730631), we get a palindrome (986767689).
The spelling of 136037058 in words is "one hundred thirty-six million, thirty-seven thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •