Base | Representation |
---|---|
bin | 101101011111110111100001… |
… | …001110011001111010110111 |
3 | 222020111120021010110010202101 |
4 | 231133313201032121322313 |
5 | 202211432404030100002 |
6 | 1545325332213522531 |
7 | 60101615230116451 |
oct | 5537674116317267 |
9 | 866446233403671 |
10 | 200102010003127 |
11 | 58838870aa8561 |
12 | 1a53913a343447 |
13 | 8786700338a8b |
14 | 375adbb9c52d1 |
15 | 18201a49b5587 |
hex | b5fde1399eb7 |
200102010003127 has 2 divisors, whose sum is σ = 200102010003128. Its totient is φ = 200102010003126.
The previous prime is 200102010003101. The next prime is 200102010003139. The reversal of 200102010003127 is 721300010201002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200102010003127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200102010003167) 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, 100051005001563 + 100051005001564.
It is an arithmetic number, because the mean of its divisors is an integer number (100051005001564).
Almost surely, 2200102010003127 is an apocalyptic number.
200102010003127 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102010003127 is an equidigital number, since it uses as much as digits as its factorization.
200102010003127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 200102010003127 its reverse (721300010201002), we get a palindrome (921402020204129).
The spelling of 200102010003127 in words is "two hundred trillion, one hundred two billion, ten million, three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •