Base | Representation |
---|---|
bin | 1011011110100100000… |
… | …1001101110101011101 |
3 | 200211222000111010112212 |
4 | 2313221001031311131 |
5 | 11212312313012321 |
6 | 230330134410205 |
7 | 20150243215415 |
oct | 2675101156535 |
9 | 624860433485 |
10 | 197182938461 |
11 | 766966a0173 |
12 | 32270200965 |
13 | 157957ca162 |
14 | 9787cd9645 |
15 | 51e0eb955b |
hex | 2de904dd5d |
197182938461 has 2 divisors, whose sum is σ = 197182938462. Its totient is φ = 197182938460.
The previous prime is 197182938397. The next prime is 197182938493. The reversal of 197182938461 is 164839281791.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 143948912836 + 53234025625 = 379406^2 + 230725^2 .
It is a cyclic number.
It is not a de Polignac number, because 197182938461 - 26 = 197182938397 is a prime.
It is a super-2 number, since 2×1971829384612 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 197182938461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (197182938061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98591469230 + 98591469231.
It is an arithmetic number, because the mean of its divisors is an integer number (98591469231).
Almost surely, 2197182938461 is an apocalyptic number.
It is an amenable number.
197182938461 is a deficient number, since it is larger than the sum of its proper divisors (1).
197182938461 is an equidigital number, since it uses as much as digits as its factorization.
197182938461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5225472, while the sum is 59.
The spelling of 197182938461 in words is "one hundred ninety-seven billion, one hundred eighty-two million, nine hundred thirty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •