Base | Representation |
---|---|
bin | 11101111011111111010011… |
… | …101110100111001001110101 |
3 | 122021012010101012221020010202 |
4 | 131323333103232213021311 |
5 | 114224203001303423303 |
6 | 1144010231042130245 |
7 | 36506352431610242 |
oct | 3573772356471165 |
9 | 567163335836122 |
10 | 131665774670453 |
11 | 38a531613110a1 |
12 | 12925861650985 |
13 | 586104c41b96a |
14 | 247292c2545c9 |
15 | 1034de0358c88 |
hex | 77bfd3ba7275 |
131665774670453 has 2 divisors, whose sum is σ = 131665774670454. Its totient is φ = 131665774670452.
The previous prime is 131665774670447. The next prime is 131665774670477. The reversal of 131665774670453 is 354076477566131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124032390342289 + 7633384328164 = 11136983^2 + 2762858^2 .
It is a cyclic number.
It is not a de Polignac number, because 131665774670453 - 212 = 131665774666357 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131665774670453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131665774670413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65832887335226 + 65832887335227.
It is an arithmetic number, because the mean of its divisors is an integer number (65832887335227).
Almost surely, 2131665774670453 is an apocalyptic number.
It is an amenable number.
131665774670453 is a deficient number, since it is larger than the sum of its proper divisors (1).
131665774670453 is an equidigital number, since it uses as much as digits as its factorization.
131665774670453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 266716800, while the sum is 65.
The spelling of 131665774670453 in words is "one hundred thirty-one trillion, six hundred sixty-five billion, seven hundred seventy-four million, six hundred seventy thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •