Base | Representation |
---|---|
bin | 10000010100110… |
… | …11010010100111 |
3 | 100112200211101110 |
4 | 20022123102213 |
5 | 240024412301 |
6 | 21331200103 |
7 | 3252030624 |
oct | 1012332247 |
9 | 315624343 |
10 | 136950951 |
11 | 7033a305 |
12 | 39a46033 |
13 | 224b0587 |
14 | 1428d34b |
15 | c0530d6 |
hex | 829b4a7 |
136950951 has 8 divisors (see below), whose sum is σ = 183072240. Its totient is φ = 91065152.
The previous prime is 136950893. The next prime is 136950967. The reversal of 136950951 is 159059631.
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 136950951 - 29 = 136950439 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136950991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57510 + ... + 59843.
It is an arithmetic number, because the mean of its divisors is an integer number (22884030).
Almost surely, 2136950951 is an apocalyptic number.
136950951 is a deficient number, since it is larger than the sum of its proper divisors (46121289).
136950951 is a wasteful number, since it uses less digits than its factorization.
136950951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117745.
The product of its (nonzero) digits is 36450, while the sum is 39.
The square root of 136950951 is about 11702.6044537103. The cubic root of 136950951 is about 515.4521444762.
The spelling of 136950951 in words is "one hundred thirty-six million, nine hundred fifty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.781 sec. • engine limits •