Base | Representation |
---|---|
bin | 1011011100101001000… |
… | …0000000101111100101 |
3 | 200210122001010200110212 |
4 | 2313022100000233211 |
5 | 11210233140121201 |
6 | 230203014225205 |
7 | 20131404365066 |
oct | 2671220005745 |
9 | 623561120425 |
10 | 196666723301 |
11 | 76451269074 |
12 | 32147355205 |
13 | 157128885b9 |
14 | 973952256d |
15 | 51b09ebabb |
hex | 2dca400be5 |
196666723301 has 2 divisors, whose sum is σ = 196666723302. Its totient is φ = 196666723300.
The previous prime is 196666723291. The next prime is 196666723333. The reversal of 196666723301 is 103327666691.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114741400225 + 81925323076 = 338735^2 + 286226^2 .
It is a cyclic number.
It is not a de Polignac number, because 196666723301 - 226 = 196599614437 is a prime.
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 196666723301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196666723501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98333361650 + 98333361651.
It is an arithmetic number, because the mean of its divisors is an integer number (98333361651).
Almost surely, 2196666723301 is an apocalyptic number.
It is an amenable number.
196666723301 is a deficient number, since it is larger than the sum of its proper divisors (1).
196666723301 is an equidigital number, since it uses as much as digits as its factorization.
196666723301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 50.
The spelling of 196666723301 in words is "one hundred ninety-six billion, six hundred sixty-six million, seven hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •