Base | Representation |
---|---|
bin | 10000010001111… |
… | …11100001011101 |
3 | 100111222201202220 |
4 | 20020333201131 |
5 | 234430400234 |
6 | 21315135553 |
7 | 3245604021 |
oct | 1010774135 |
9 | 314881686 |
10 | 136575069 |
11 | 70102964 |
12 | 398a45b9 |
13 | 223ab467 |
14 | 141d2381 |
15 | becba49 |
hex | 823f85d |
136575069 has 8 divisors (see below), whose sum is σ = 182589792. Its totient is φ = 90805200.
The previous prime is 136575067. The next prime is 136575073. The reversal of 136575069 is 960575631.
It is a happy number.
136575069 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 not a de Polignac number, because 136575069 - 21 = 136575067 is a prime.
It is a super-2 number, since 2×1365750692 = 37305498944709522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 136575069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136575067) 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, 59907 + ... + 62144.
It is an arithmetic number, because the mean of its divisors is an integer number (22823724).
Almost surely, 2136575069 is an apocalyptic number.
It is an amenable number.
136575069 is a deficient number, since it is larger than the sum of its proper divisors (46014723).
136575069 is a wasteful number, since it uses less digits than its factorization.
136575069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122427.
The product of its (nonzero) digits is 170100, while the sum is 42.
The square root of 136575069 is about 11686.5336605856. The cubic root of 136575069 is about 514.9801343391.
The spelling of 136575069 in words is "one hundred thirty-six million, five hundred seventy-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •