Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0001101110110001011 |
3 | 101112110002222222220100 |
4 | 1212220200031312023 |
5 | 3301143001400021 |
6 | 122343054100443 |
7 | 10650613513260 |
oct | 1465040156613 |
9 | 345402888810 |
10 | 110201200011 |
11 | 42810782711 |
12 | 194361aa723 |
13 | a5130b4476 |
14 | 5495bd9267 |
15 | 2ceeadc626 |
hex | 19a880dd8b |
110201200011 has 12 divisors (see below), whose sum is σ = 181919441392. Its totient is φ = 62972114256.
The previous prime is 110201199961. The next prime is 110201200063. The reversal of 110201200011 is 110002102011.
It is a happy number.
It is not a de Polignac number, because 110201200011 - 211 = 110201197963 is a prime.
It is a super-4 number, since 4×1102012000114 (a number of 45 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110201199966 and 110201200002.
It is not an unprimeable number, because it can be changed into a prime (110201200511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 874612636 + ... + 874612761.
Almost surely, 2110201200011 is an apocalyptic number.
110201200011 is a deficient number, since it is larger than the sum of its proper divisors (71718241381).
110201200011 is a wasteful number, since it uses less digits than its factorization.
110201200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1749225410 (or 1749225407 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110201200011 its reverse (110002102011), we get a palindrome (220203302022).
The spelling of 110201200011 in words is "one hundred ten billion, two hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •