Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …101011001100011000011001 |
3 | 111010102200022010200010212102 |
4 | 112300223130223030120121 |
5 | 101110033311242023001 |
6 | 552522153120053145 |
7 | 30041101040561120 |
oct | 2660533453143031 |
9 | 433380263603772 |
10 | 100102210111001 |
11 | 29994121a4839a |
12 | b28858b7641b5 |
13 | 43b17a07b7277 |
14 | 1aa0d895c2ab7 |
15 | b88d4ca71e6b |
hex | 5b0adcacc619 |
100102210111001 has 8 divisors (see below), whose sum is σ = 114437057266944. Its totient is φ = 85775995811520.
The previous prime is 100102210110871. The next prime is 100102210111081. The reversal of 100102210111001 is 100111012201001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100102210111001 - 214 = 100102210094617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102210111081) 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 7 ways as a sum of consecutive naturals, for example, 2158189265 + ... + 2158235646.
It is an arithmetic number, because the mean of its divisors is an integer number (14304632158368).
Almost surely, 2100102210111001 is an apocalyptic number.
It is an amenable number.
100102210111001 is a deficient number, since it is larger than the sum of its proper divisors (14334847155943).
100102210111001 is an equidigital number, since it uses as much as digits as its factorization.
100102210111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4316428231.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100102210111001 its reverse (100111012201001), we get a palindrome (200213222312002).
The spelling of 100102210111001 in words is "one hundred trillion, one hundred two billion, two hundred ten million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •