Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010011100100101000001 |
3 | 111010102122202111200120002221 |
4 | 112300223100022130211001 |
5 | 101110032344022400001 |
6 | 552522120221011041 |
7 | 30041062611424522 |
oct | 2660532012344501 |
9 | 433378674616087 |
10 | 100102000200001 |
11 | 29994024506128 |
12 | b2885313b3a81 |
13 | 43b176916ca87 |
14 | 1aa0d69780849 |
15 | b88d3940b1a1 |
hex | 5b0ad029c941 |
100102000200001 has 8 divisors (see below), whose sum is σ = 100115935657920. Its totient is φ = 100088065649712.
The previous prime is 100102000199977. The next prime is 100102000200043. The reversal of 100102000200001 is 100002000201001.
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 100102000200001 - 25 = 100102000199969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102000200101) 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, 237390316 + ... + 237811618.
It is an arithmetic number, because the mean of its divisors is an integer number (12514491957240).
Almost surely, 2100102000200001 is an apocalyptic number.
It is an amenable number.
100102000200001 is a deficient number, since it is larger than the sum of its proper divisors (13935457919).
100102000200001 is a wasteful number, since it uses less digits than its factorization.
100102000200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453815.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 100102000200001 its reverse (100002000201001), we get a palindrome (200104000401002).
The spelling of 100102000200001 in words is "one hundred trillion, one hundred two billion, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •