Base | Representation |
---|---|
bin | 10110110010000110101101… |
… | …111011001011011100001111 |
3 | 111010210001020220210100012202 |
4 | 112302012231323023130033 |
5 | 101113140012231120421 |
6 | 553035201354152115 |
7 | 30051140420215625 |
oct | 2662065573133417 |
9 | 433701226710182 |
10 | 100200210020111 |
11 | 29a21741384613 |
12 | b2a357b72263b |
13 | 43baabab1a176 |
14 | 1aa5a04b63515 |
15 | b8b6863cc10b |
hex | 5b21adecb70f |
100200210020111 has 8 divisors (see below), whose sum is σ = 106099661859840. Its totient is φ = 94301349495808.
The previous prime is 100200210020089. The next prime is 100200210020159. The reversal of 100200210020111 is 111020012002001.
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 100200210020111 - 210 = 100200210019087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100200210020092 and 100200210020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200210028111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147479951 + ... + 148157808.
It is an arithmetic number, because the mean of its divisors is an integer number (13262457732480).
Almost surely, 2100200210020111 is an apocalyptic number.
100200210020111 is a deficient number, since it is larger than the sum of its proper divisors (5899451839729).
100200210020111 is a wasteful number, since it uses less digits than its factorization.
100200210020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295657713.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100200210020111 its reverse (111020012002001), we get a palindrome (211220222022112).
The spelling of 100200210020111 in words is "one hundred trillion, two hundred billion, two hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •