Base | Representation |
---|---|
bin | 111110010000011100… |
… | …0001001001111010001 |
3 | 110210002110210220110201 |
4 | 1330200320021033101 |
5 | 4142302031344433 |
6 | 141230252055201 |
7 | 12442046431321 |
oct | 1744070111721 |
9 | 423073726421 |
10 | 133695574993 |
11 | 51777737342 |
12 | 21ab2464501 |
13 | c7b87092b6 |
14 | 6684217281 |
15 | 3727503a7d |
hex | 1f20e093d1 |
133695574993 has 2 divisors, whose sum is σ = 133695574994. Its totient is φ = 133695574992.
The previous prime is 133695574951. The next prime is 133695575011. The reversal of 133695574993 is 399475596331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104928701329 + 28766873664 = 323927^2 + 169608^2 .
It is a cyclic number.
It is not a de Polignac number, because 133695574993 - 225 = 133662020561 is a prime.
It is not a weakly prime, because it can be changed into another prime (133695574193) 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, 66847787496 + 66847787497.
It is an arithmetic number, because the mean of its divisors is an integer number (66847787497).
Almost surely, 2133695574993 is an apocalyptic number.
It is an amenable number.
133695574993 is a deficient number, since it is larger than the sum of its proper divisors (1).
133695574993 is an equidigital number, since it uses as much as digits as its factorization.
133695574993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 82668600, while the sum is 64.
The spelling of 133695574993 in words is "one hundred thirty-three billion, six hundred ninety-five million, five hundred seventy-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •