Base | Representation |
---|---|
bin | 10111001101110000111111… |
… | …000010100100110100001001 |
3 | 111101111202120122111021002010 |
4 | 113031300333002210310021 |
5 | 101340310342132401301 |
6 | 1001052321113130133 |
7 | 30335361314161401 |
oct | 2715607702446411 |
9 | 441452518437063 |
10 | 102101020200201 |
11 | 2a594888153620 |
12 | b54ba410b9949 |
13 | 44c811467a4b9 |
14 | 1b2da0400b801 |
15 | bc0d363585d6 |
hex | 5cdc3f0a4d09 |
102101020200201 has 64 divisors (see below), whose sum is σ = 152118981642240. Its totient is φ = 60393661440000.
The previous prime is 102101020200197. The next prime is 102101020200227. The reversal of 102101020200201 is 102002020101201.
It is not a de Polignac number, because 102101020200201 - 22 = 102101020200197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102101020200241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1545009106 + ... + 1545075188.
It is an arithmetic number, because the mean of its divisors is an integer number (2376859088160).
Almost surely, 2102101020200201 is an apocalyptic number.
102101020200201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102101020200201 is a deficient number, since it is larger than the sum of its proper divisors (50017961442039).
102101020200201 is a wasteful number, since it uses less digits than its factorization.
102101020200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72798.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102101020200201 its reverse (102002020101201), we get a palindrome (204103040301402).
The spelling of 102101020200201 in words is "one hundred two trillion, one hundred one billion, twenty million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •