Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001010001001000010100001 |
3 | 111101111200110111022212002122 |
4 | 113031300032022021002201 |
5 | 101340302202211200001 |
6 | 1001052103455354025 |
7 | 30335332065350615 |
oct | 2715601612110241 |
9 | 441450414285078 |
10 | 102100200100001 |
11 | 2a5944a7234164 |
12 | b54b852522915 |
13 | 44c80137aa6cc |
14 | 1b2d96712d345 |
15 | bc0cd9360b1b |
hex | 5cdc0e2890a1 |
102100200100001 has 8 divisors (see below), whose sum is σ = 102231052862400. Its totient is φ = 101969369148880.
The previous prime is 102100200099971. The next prime is 102100200100103. The reversal of 102100200100001 is 100001002001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102100200100001 - 210 = 102100200098977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102100200100901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3925655 + ... + 14819283.
It is an arithmetic number, because the mean of its divisors is an integer number (12778881607800).
Almost surely, 2102100200100001 is an apocalyptic number.
It is an amenable number.
102100200100001 is a deficient number, since it is larger than the sum of its proper divisors (130852762399).
102100200100001 is a wasteful number, since it uses less digits than its factorization.
102100200100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10905639.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102100200100001 its reverse (100001002001201), we get a palindrome (202101202101202).
The spelling of 102100200100001 in words is "one hundred two trillion, one hundred billion, two hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •