Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …101010110000000101001111 |
3 | 111010210010022202000100122102 |
4 | 112302013131222300011033 |
5 | 101113143132310120421 |
6 | 553035413050305315 |
7 | 30051166314465611 |
oct | 2662073552600517 |
9 | 433703282010572 |
10 | 100201011020111 |
11 | 29a22012538791 |
12 | b2a3763a2823b |
13 | 43babb7a60271 |
14 | 1aa5a7d2acdb1 |
15 | b8b6d18a060b |
hex | 5b21ddab014f |
100201011020111 has 4 divisors (see below), whose sum is σ = 102091596133752. Its totient is φ = 98310425906472.
The previous prime is 100201011020083. The next prime is 100201011020197. The reversal of 100201011020111 is 111020110102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100201011020111 - 222 = 100201006825807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201011020092 and 100201011020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201011020311) 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, 945292556741 + ... + 945292556846.
It is an arithmetic number, because the mean of its divisors is an integer number (25522899033438).
Almost surely, 2100201011020111 is an apocalyptic number.
100201011020111 is a deficient number, since it is larger than the sum of its proper divisors (1890585113641).
100201011020111 is an equidigital number, since it uses as much as digits as its factorization.
100201011020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1890585113640.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100201011020111 its reverse (111020110102001), we get a palindrome (211221121122112).
The spelling of 100201011020111 in words is "one hundred trillion, two hundred one billion, eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •