Base | Representation |
---|---|
bin | 1111111101111… |
… | …11000000011001 |
3 | 100100001102221011 |
4 | 13332333000121 |
5 | 233242422023 |
6 | 21143013521 |
7 | 3214366123 |
oct | 776770031 |
9 | 310042834 |
10 | 133951513 |
11 | 69680833 |
12 | 38a3a2a1 |
13 | 219a0267 |
14 | 13b0c213 |
15 | bb5e50d |
hex | 7fbf019 |
133951513 has 2 divisors, whose sum is σ = 133951514. Its totient is φ = 133951512.
The previous prime is 133951487. The next prime is 133951549. The reversal of 133951513 is 315159331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129777664 + 4173849 = 11392^2 + 2043^2 .
It is an emirp because it is prime and its reverse (315159331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133951513 - 213 = 133943321 is a prime.
It is not a weakly prime, because it can be changed into another prime (133955513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66975756 + 66975757.
It is an arithmetic number, because the mean of its divisors is an integer number (66975757).
Almost surely, 2133951513 is an apocalyptic number.
It is an amenable number.
133951513 is a deficient number, since it is larger than the sum of its proper divisors (1).
133951513 is an equidigital number, since it uses as much as digits as its factorization.
133951513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6075, while the sum is 31.
The square root of 133951513 is about 11573.7423938845. The cubic root of 133951513 is about 511.6612660690.
The spelling of 133951513 in words is "one hundred thirty-three million, nine hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •