Base | Representation |
---|---|
bin | 101101101111110110001100… |
… | …100011001101000111001101 |
3 | 222101101112121222102112002101 |
4 | 231233312030203031013031 |
5 | 202332430301330120414 |
6 | 1551530014515155101 |
7 | 60244141031552032 |
oct | 5557661443150715 |
9 | 871345558375071 |
10 | 201200101020109 |
11 | 59121535828334 |
12 | 1a695b168a5a91 |
13 | 883611b7867a9 |
14 | 37981cb727389 |
15 | 183da22a81a74 |
hex | b6fd8c8cd1cd |
201200101020109 has 2 divisors, whose sum is σ = 201200101020110. Its totient is φ = 201200101020108.
The previous prime is 201200101020091. The next prime is 201200101020137. The reversal of 201200101020109 is 901020101002102.
It is a happy number.
Together with previous prime (201200101020091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 193455691057225 + 7744409962884 = 13908835^2 + 2782878^2 .
It is a cyclic number.
It is not a de Polignac number, because 201200101020109 - 217 = 201200100889037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201200101000109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100600050510054 + 100600050510055.
It is an arithmetic number, because the mean of its divisors is an integer number (100600050510055).
Almost surely, 2201200101020109 is an apocalyptic number.
It is an amenable number.
201200101020109 is a deficient number, since it is larger than the sum of its proper divisors (1).
201200101020109 is an equidigital number, since it uses as much as digits as its factorization.
201200101020109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 201200101020109 in words is "two hundred one trillion, two hundred billion, one hundred one million, twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •