Base | Representation |
---|---|
bin | 101100100101110110010111… |
… | …011111001010100000011101 |
3 | 221201101102012120002001102022 |
4 | 230211312113133022200131 |
5 | 201201122102031404043 |
6 | 1533034001311105525 |
7 | 56210562410534441 |
oct | 5445662737124035 |
9 | 851342176061368 |
10 | 196115043231773 |
11 | 57540a17217536 |
12 | 19bb44ab2122a5 |
13 | 8557752777773 |
14 | 36600395c0821 |
15 | 17a1607d22868 |
hex | b25d977ca81d |
196115043231773 has 2 divisors, whose sum is σ = 196115043231774. Its totient is φ = 196115043231772.
The previous prime is 196115043231769. The next prime is 196115043231781. The reversal of 196115043231773 is 377132340511691.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 185449188628729 + 10665854603044 = 13617973^2 + 3265862^2 .
It is a cyclic number.
It is not a de Polignac number, because 196115043231773 - 22 = 196115043231769 is a prime.
It is a super-2 number, since 2×1961150432317732 (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 (196115043291773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98057521615886 + 98057521615887.
It is an arithmetic number, because the mean of its divisors is an integer number (98057521615887).
Almost surely, 2196115043231773 is an apocalyptic number.
It is an amenable number.
196115043231773 is a deficient number, since it is larger than the sum of its proper divisors (1).
196115043231773 is an equidigital number, since it uses as much as digits as its factorization.
196115043231773 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 196115043231773 in words is "one hundred ninety-six trillion, one hundred fifteen billion, forty-three million, two hundred thirty-one thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •