Base | Representation |
---|---|
bin | 10000010100110… |
… | …11011000010001 |
3 | 100112200211212212 |
4 | 20022123120101 |
5 | 240024420223 |
6 | 21331201505 |
7 | 3252031652 |
oct | 1012333021 |
9 | 315624785 |
10 | 136951313 |
11 | 7033a604 |
12 | 39a46295 |
13 | 224b07a5 |
14 | 1428d529 |
15 | c053278 |
hex | 829b611 |
136951313 has 2 divisors, whose sum is σ = 136951314. Its totient is φ = 136951312.
The previous prime is 136951301. The next prime is 136951327. The reversal of 136951313 is 313159631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97160449 + 39790864 = 9857^2 + 6308^2 .
It is a cyclic number.
It is not a de Polignac number, because 136951313 - 28 = 136951057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136951313.
It is not a weakly prime, because it can be changed into another prime (136951013) 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 as a sum of consecutive naturals, namely, 68475656 + 68475657.
It is an arithmetic number, because the mean of its divisors is an integer number (68475657).
Almost surely, 2136951313 is an apocalyptic number.
It is an amenable number.
136951313 is a deficient number, since it is larger than the sum of its proper divisors (1).
136951313 is an equidigital number, since it uses as much as digits as its factorization.
136951313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7290, while the sum is 32.
The square root of 136951313 is about 11702.6199203426. The cubic root of 136951313 is about 515.4525986376.
The spelling of 136951313 in words is "one hundred thirty-six million, nine hundred fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •