Base | Representation |
---|---|
bin | 111110111001010111… |
… | …0000100000111101101 |
3 | 110220122011112001220021 |
4 | 1331302232010013231 |
5 | 4203110034224201 |
6 | 142014422122141 |
7 | 12521061463204 |
oct | 1756256040755 |
9 | 426564461807 |
10 | 135068664301 |
11 | 5231181569a |
12 | 22216280351 |
13 | c977024c8c |
14 | 677472223b |
15 | 37a7d2eea1 |
hex | 1f72b841ed |
135068664301 has 2 divisors, whose sum is σ = 135068664302. Its totient is φ = 135068664300.
The previous prime is 135068664257. The next prime is 135068664331. The reversal of 135068664301 is 103466860531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116845014276 + 18223650025 = 341826^2 + 134995^2 .
It is a cyclic number.
It is not a de Polignac number, because 135068664301 - 213 = 135068656109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135068664331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67534332150 + 67534332151.
It is an arithmetic number, because the mean of its divisors is an integer number (67534332151).
Almost surely, 2135068664301 is an apocalyptic number.
It is an amenable number.
135068664301 is a deficient number, since it is larger than the sum of its proper divisors (1).
135068664301 is an equidigital number, since it uses as much as digits as its factorization.
135068664301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 135068664301 in words is "one hundred thirty-five billion, sixty-eight million, six hundred sixty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •