Base | Representation |
---|---|
bin | 110011010100100011… |
… | …0000001010001110001 |
3 | 101112110210122110212000 |
4 | 1212221012001101301 |
5 | 3301203021010001 |
6 | 122344050324213 |
7 | 10651063656336 |
oct | 1465106012161 |
9 | 345423573760 |
10 | 110211110001 |
11 | 42816331193 |
12 | 19439589669 |
13 | a515174075 |
14 | 549725898d |
15 | 2d008e8a86 |
hex | 19a9181471 |
110211110001 has 8 divisors (see below), whose sum is σ = 163275718560. Its totient is φ = 73474073316.
The previous prime is 110211109999. The next prime is 110211110027. The reversal of 110211110001 is 100011112011.
It is not a de Polignac number, because 110211110001 - 21 = 110211109999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110211110701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2040946455 + ... + 2040946508.
It is an arithmetic number, because the mean of its divisors is an integer number (20409464820).
Almost surely, 2110211110001 is an apocalyptic number.
It is an amenable number.
110211110001 is a deficient number, since it is larger than the sum of its proper divisors (53064608559).
110211110001 is an equidigital number, since it uses as much as digits as its factorization.
110211110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4081892972 (or 4081892966 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110211110001 its reverse (100011112011), we get a palindrome (210222222012).
The spelling of 110211110001 in words is "one hundred ten billion, two hundred eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •