Base | Representation |
---|---|
bin | 11001000010001011100100… |
… | …001100000000110100101011 |
3 | 112102211112222101112111202201 |
4 | 121002023210030000310223 |
5 | 103412343342111120021 |
6 | 1030055413233241031 |
7 | 32122351625520406 |
oct | 3102134414006453 |
9 | 472745871474681 |
10 | 110101020020011 |
11 | 32099642523439 |
12 | 10422394a03177 |
13 | 495863520a627 |
14 | 1d28cbc640d3d |
15 | cadea8285591 |
hex | 6422e4300d2b |
110101020020011 has 4 divisors (see below), whose sum is σ = 115895810547400. Its totient is φ = 104306229492624.
The previous prime is 110101020019999. The next prime is 110101020020027. The reversal of 110101020020011 is 110020020101011.
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 110101020020011 - 25 = 110101020019979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110101020020011.
It is not an unprimeable number, because it can be changed into a prime (110101020020041) 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, 2897395263666 + ... + 2897395263703.
It is an arithmetic number, because the mean of its divisors is an integer number (28973952636850).
Almost surely, 2110101020020011 is an apocalyptic number.
110101020020011 is a deficient number, since it is larger than the sum of its proper divisors (5794790527389).
110101020020011 is an equidigital number, since it uses as much as digits as its factorization.
110101020020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5794790527388.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110101020020011 its reverse (110020020101011), we get a palindrome (220121040121022).
The spelling of 110101020020011 in words is "one hundred ten trillion, one hundred one billion, twenty million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •