Base | Representation |
---|---|
bin | 11001000000111000110110… |
… | …101100101111111100000101 |
3 | 112102112001202001212001212210 |
4 | 121000320312230233330011 |
5 | 103404420001231120401 |
6 | 1025550524522534033 |
7 | 32113056056133024 |
oct | 3100706654577405 |
9 | 472461661761783 |
10 | 110012210020101 |
11 | 32064a095a8aa4 |
12 | 1040912a667319 |
13 | 4950150abb01c |
14 | 1d248957cc8bb |
15 | caba0b61b4d6 |
hex | 640e36b2ff05 |
110012210020101 has 4 divisors (see below), whose sum is σ = 146682946693472. Its totient is φ = 73341473346732.
The previous prime is 110012210020091. The next prime is 110012210020109. The reversal of 110012210020101 is 101020012210011.
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 not a de Polignac number, because 110012210020101 - 233 = 110003620085509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012210020109) 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, 18335368336681 + ... + 18335368336686.
It is an arithmetic number, because the mean of its divisors is an integer number (36670736673368).
Almost surely, 2110012210020101 is an apocalyptic number.
It is an amenable number.
110012210020101 is a deficient number, since it is larger than the sum of its proper divisors (36670736673371).
110012210020101 is an equidigital number, since it uses as much as digits as its factorization.
110012210020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36670736673370.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110012210020101 its reverse (101020012210011), we get a palindrome (211032222230112).
The spelling of 110012210020101 in words is "one hundred ten trillion, twelve billion, two hundred ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •