Base | Representation |
---|---|
bin | 10000001110100… |
… | …00111010111101 |
3 | 100111010201100020 |
4 | 20013100322331 |
5 | 234321401140 |
6 | 21301322353 |
7 | 3242006163 |
oct | 1007207275 |
9 | 314121306 |
10 | 136122045 |
11 | 6a923564 |
12 | 397063b9 |
13 | 222801b7 |
14 | 14115233 |
15 | be3c6d0 |
hex | 81d0ebd |
136122045 has 8 divisors (see below), whose sum is σ = 217795296. Its totient is φ = 72598416.
The previous prime is 136122037. The next prime is 136122059. The reversal of 136122045 is 540221631.
136122045 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 136122045 - 23 = 136122037 is a prime.
It is a super-2 number, since 2×1361220452 = 37058422269964050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4537387 + ... + 4537416.
It is an arithmetic number, because the mean of its divisors is an integer number (27224412).
Almost surely, 2136122045 is an apocalyptic number.
136122045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
136122045 is a deficient number, since it is larger than the sum of its proper divisors (81673251).
136122045 is an equidigital number, since it uses as much as digits as its factorization.
136122045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9074811.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 136122045 is about 11667.1352524945. The cubic root of 136122045 is about 514.4101015816.
Adding to 136122045 its reverse (540221631), we get a palindrome (676343676).
The spelling of 136122045 in words is "one hundred thirty-six million, one hundred twenty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •