Base | Representation |
---|---|
bin | 10000001110110… |
… | …11101010011001 |
3 | 100111012221200201 |
4 | 20013123222121 |
5 | 234324303131 |
6 | 21302302201 |
7 | 3242251354 |
oct | 1007335231 |
9 | 314187621 |
10 | 136166041 |
11 | 6a953620 |
12 | 39727961 |
13 | 2229722b |
14 | 1412729b |
15 | be4a761 |
hex | 81dba99 |
136166041 has 8 divisors (see below), whose sum is σ = 151063200. Its totient is φ = 121688640.
The previous prime is 136166029. The next prime is 136166083. The reversal of 136166041 is 140661631.
136166041 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.
It is a cyclic number.
It is not a de Polignac number, because 136166041 - 213 = 136157849 is a prime.
It is a super-2 number, since 2×1361660412 = 37082381443227362, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136166011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104256 + ... + 105553.
It is an arithmetic number, because the mean of its divisors is an integer number (18882900).
Almost surely, 2136166041 is an apocalyptic number.
136166041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
136166041 is a deficient number, since it is larger than the sum of its proper divisors (14897159).
136166041 is a wasteful number, since it uses less digits than its factorization.
136166041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209879.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 136166041 is about 11669.0205672970. The cubic root of 136166041 is about 514.4655164337.
The spelling of 136166041 in words is "one hundred thirty-six million, one hundred sixty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •