Base | Representation |
---|---|
bin | 11110101111011000101100… |
… | …110000010010111011110101 |
3 | 122201200202222100122100112022 |
4 | 132233120230300102323311 |
5 | 120210034423214321321 |
6 | 1155312551432402525 |
7 | 40322466550513001 |
oct | 3657305460227365 |
9 | 581622870570468 |
10 | 135197731401461 |
11 | 3a095043862263 |
12 | 131b6286846445 |
13 | 5a59125969301 |
14 | 255586860d701 |
15 | 1096c0aec1dab |
hex | 7af62cc12ef5 |
135197731401461 has 2 divisors, whose sum is σ = 135197731401462. Its totient is φ = 135197731401460.
The previous prime is 135197731401419. The next prime is 135197731401511. The reversal of 135197731401461 is 164104137791531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92901048513361 + 42296682888100 = 9638519^2 + 6503590^2 .
It is a cyclic number.
It is not a de Polignac number, because 135197731401461 - 226 = 135197664292597 is a prime.
It is a super-2 number, since 2×1351977314014612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135197731401401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67598865700730 + 67598865700731.
It is an arithmetic number, because the mean of its divisors is an integer number (67598865700731).
Almost surely, 2135197731401461 is an apocalyptic number.
It is an amenable number.
135197731401461 is a deficient number, since it is larger than the sum of its proper divisors (1).
135197731401461 is an equidigital number, since it uses as much as digits as its factorization.
135197731401461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1905120, while the sum is 53.
The spelling of 135197731401461 in words is "one hundred thirty-five trillion, one hundred ninety-seven billion, seven hundred thirty-one million, four hundred one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •