Base | Representation |
---|---|
bin | 1001001100100011001110… |
… | …1100000011001010100101 |
3 | 1022210121211022122211001210 |
4 | 2103020303230003022211 |
5 | 2311130234332400401 |
6 | 33301010323542033 |
7 | 2062340314424406 |
oct | 223106354031245 |
9 | 38717738584053 |
10 | 10111220200101 |
11 | 3249165227569 |
12 | 117375722a919 |
13 | 58463a3a0107 |
14 | 26d5583bd9ad |
15 | 1280392164d6 |
hex | 93233b032a5 |
10111220200101 has 8 divisors (see below), whose sum is σ = 13768470059904. Its totient is φ = 6597391903520.
The previous prime is 10111220200057. The next prime is 10111220200111. The reversal of 10111220200101 is 10100202211101.
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 10111220200101 - 29 = 10111220199589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111220200111) 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, 35855390640 + ... + 35855390921.
It is an arithmetic number, because the mean of its divisors is an integer number (1721058757488).
Almost surely, 210111220200101 is an apocalyptic number.
It is an amenable number.
10111220200101 is a deficient number, since it is larger than the sum of its proper divisors (3657249859803).
10111220200101 is an equidigital number, since it uses as much as digits as its factorization.
10111220200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71710781611.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10111220200101 its reverse (10100202211101), we get a palindrome (20211422411202).
The spelling of 10111220200101 in words is "ten trillion, one hundred eleven billion, two hundred twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •