Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …101010000011010101111011 |
3 | 112110012010002120100000111110 |
4 | 121003220230222003111323 |
5 | 103421013142121231021 |
6 | 1030213352202131403 |
7 | 32132522003300106 |
oct | 3103505452032573 |
9 | 473163076300443 |
10 | 110201020102011 |
11 | 32127a98a05103 |
12 | 104398427b0b63 |
13 | 4964bb0a48497 |
14 | 1d2da876c373d |
15 | cb18ac4d9476 |
hex | 643a2ca8357b |
110201020102011 has 32 divisors (see below), whose sum is σ = 154431271202560. Its totient is φ = 69812173759104.
The previous prime is 110201020101971. The next prime is 110201020102049.
110201020102011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 110201020102011 - 215 = 110201020069243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110201020103011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45269520 + ... + 47641698.
It is an arithmetic number, because the mean of its divisors is an integer number (4825977225080).
Almost surely, 2110201020102011 is an apocalyptic number.
110201020102011 is a deficient number, since it is larger than the sum of its proper divisors (44230251100549).
110201020102011 is a wasteful number, since it uses less digits than its factorization.
110201020102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381995.
The product of its (nonzero) digits is 8, while the sum is 12.
The spelling of 110201020102011 in words is "one hundred ten trillion, two hundred one billion, twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •