Base | Representation |
---|---|
bin | 111110111011110011… |
… | …0110111100101000001 |
3 | 110220211212211002100012 |
4 | 1331313212313211001 |
5 | 4203242032222001 |
6 | 142030511434305 |
7 | 12523105455323 |
oct | 1756746674501 |
9 | 426755732305 |
10 | 135150664001 |
11 | 52354032241 |
12 | 22239825995 |
13 | c98b005602 |
14 | 6781589613 |
15 | 37b012b2bb |
hex | 1f779b7941 |
135150664001 has 2 divisors, whose sum is σ = 135150664002. Its totient is φ = 135150664000.
The previous prime is 135150663961. The next prime is 135150664027. The reversal of 135150664001 is 100466051531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114965074225 + 20185589776 = 339065^2 + 142076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135150664001 is a prime.
It is a super-2 number, since 2×1351506640012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (135150664031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67575332000 + 67575332001.
It is an arithmetic number, because the mean of its divisors is an integer number (67575332001).
Almost surely, 2135150664001 is an apocalyptic number.
It is an amenable number.
135150664001 is a deficient number, since it is larger than the sum of its proper divisors (1).
135150664001 is an equidigital number, since it uses as much as digits as its factorization.
135150664001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 135150664001 in words is "one hundred thirty-five billion, one hundred fifty million, six hundred sixty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •