Base | Representation |
---|---|
bin | 101101101100111101110110… |
… | …110111100010010111010101 |
3 | 222100200121201201221200112111 |
4 | 231230331312313202113111 |
5 | 202321204420200140134 |
6 | 1551255042131551021 |
7 | 60223633056222421 |
oct | 5554756667422725 |
9 | 870617651850474 |
10 | 201002168755669 |
11 | 590555a51684a6 |
12 | 1a66369775b471 |
13 | 88205669698a8 |
14 | 378c7b20d3b81 |
15 | 18387dadeec64 |
hex | b6cf76de25d5 |
201002168755669 has 2 divisors, whose sum is σ = 201002168755670. Its totient is φ = 201002168755668.
The previous prime is 201002168755639. The next prime is 201002168755691. The reversal of 201002168755669 is 966557861200102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178065138251025 + 22937030504644 = 13344105^2 + 4789262^2 .
It is a cyclic number.
It is not a de Polignac number, because 201002168755669 - 27 = 201002168755541 is a prime.
It is a super-2 number, since 2×2010021687556692 (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 (201002168755639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100501084377834 + 100501084377835.
It is an arithmetic number, because the mean of its divisors is an integer number (100501084377835).
Almost surely, 2201002168755669 is an apocalyptic number.
It is an amenable number.
201002168755669 is a deficient number, since it is larger than the sum of its proper divisors (1).
201002168755669 is an equidigital number, since it uses as much as digits as its factorization.
201002168755669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10886400, while the sum is 58.
The spelling of 201002168755669 in words is "two hundred one trillion, two billion, one hundred sixty-eight million, seven hundred fifty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •