Base | Representation |
---|---|
bin | 101101101100111101110110… |
… | …110111100010010111101011 |
3 | 222100200121201201221200120022 |
4 | 231230331312313202113223 |
5 | 202321204420200140231 |
6 | 1551255042131551055 |
7 | 60223633056222452 |
oct | 5554756667422753 |
9 | 870617651850508 |
10 | 201002168755691 |
11 | 590555a5168516 |
12 | 1a66369775b48b |
13 | 88205669698c4 |
14 | 378c7b20d3b99 |
15 | 18387dadeec7b |
hex | b6cf76de25eb |
201002168755691 has 2 divisors, whose sum is σ = 201002168755692. Its totient is φ = 201002168755690.
The previous prime is 201002168755669. The next prime is 201002168755747. The reversal of 201002168755691 is 196557861200102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201002168755691 - 26 = 201002168755627 is a prime.
It is not a weakly prime, because it can be changed into another prime (201002168752691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100501084377845 + 100501084377846.
It is an arithmetic number, because the mean of its divisors is an integer number (100501084377846).
Almost surely, 2201002168755691 is an apocalyptic number.
201002168755691 is a deficient number, since it is larger than the sum of its proper divisors (1).
201002168755691 is an equidigital number, since it uses as much as digits as its factorization.
201002168755691 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 53.
The spelling of 201002168755691 in words is "two hundred one trillion, two billion, one hundred sixty-eight million, seven hundred fifty-five thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •