Base | Representation |
---|---|
bin | 10000010000010… |
… | …01110010011011 |
3 | 100111120112212010 |
4 | 20020021302123 |
5 | 234401324341 |
6 | 21310321003 |
7 | 3243666234 |
oct | 1010116233 |
9 | 314515763 |
10 | 136354971 |
11 | 6aa72565 |
12 | 397b9163 |
13 | 2233221c |
14 | 1417608b |
15 | be86716 |
hex | 8209c9b |
136354971 has 32 divisors (see below), whose sum is σ = 196213248. Its totient is φ = 84015360.
The previous prime is 136354961. The next prime is 136354979. The reversal of 136354971 is 179453631.
It is not a de Polignac number, because 136354971 - 27 = 136354843 is a prime.
It is not an unprimeable number, because it can be changed into a prime (136354979) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 444000 + ... + 444306.
It is an arithmetic number, because the mean of its divisors is an integer number (6131664).
Almost surely, 2136354971 is an apocalyptic number.
136354971 is a deficient number, since it is larger than the sum of its proper divisors (59858277).
136354971 is a wasteful number, since it uses less digits than its factorization.
136354971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531.
The product of its digits is 68040, while the sum is 39.
The square root of 136354971 is about 11677.1131278240. The cubic root of 136354971 is about 514.7033462919.
The spelling of 136354971 in words is "one hundred thirty-six million, three hundred fifty-four thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •