Base | Representation |
---|---|
bin | 10110110010010000110111… |
… | …001001100111111011100001 |
3 | 111010211002101000101102111111 |
4 | 112302100313021213323201 |
5 | 101113324314132020001 |
6 | 553044202251543321 |
7 | 30052004350331503 |
oct | 2662206711477341 |
9 | 433732330342444 |
10 | 100211102220001 |
11 | 29a26320783603 |
12 | b2a56bb45ab41 |
13 | 43bbb355cc866 |
14 | 1aa63595b1d73 |
15 | b8bac2775851 |
hex | 5b2437267ee1 |
100211102220001 has 4 divisors (see below), whose sum is σ = 100215149052592. Its totient is φ = 100207055387412.
The previous prime is 100211102219947. The next prime is 100211102220049. The reversal of 100211102220001 is 100022201112001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100211102220001 - 27 = 100211102219873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100211102224001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2023379151 + ... + 2023428676.
It is an arithmetic number, because the mean of its divisors is an integer number (25053787263148).
Almost surely, 2100211102220001 is an apocalyptic number.
It is an amenable number.
100211102220001 is a deficient number, since it is larger than the sum of its proper divisors (4046832591).
100211102220001 is an equidigital number, since it uses as much as digits as its factorization.
100211102220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4046832590.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100211102220001 its reverse (100022201112001), we get a palindrome (200233303332002).
The spelling of 100211102220001 in words is "one hundred trillion, two hundred eleven billion, one hundred two million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •