Base | Representation |
---|---|
bin | 110011101100010111… |
… | …0010011101010001001 |
3 | 101121112111021110112100 |
4 | 1213120232103222021 |
5 | 3304322102401301 |
6 | 122555233504013 |
7 | 11006636063355 |
oct | 1473056235211 |
9 | 347474243470 |
10 | 111010200201 |
11 | 4309640050a |
12 | 19621112009 |
13 | a611898ac4 |
14 | 5531428465 |
15 | 2d4ab41286 |
hex | 19d8b93a89 |
111010200201 has 12 divisors (see below), whose sum is σ = 160677330112. Its totient is φ = 73854832536.
The previous prime is 111010200181. The next prime is 111010200211. The reversal of 111010200201 is 102002010111.
It is a happy number.
It is not a de Polignac number, because 111010200201 - 213 = 111010192009 is a prime.
It is a super-2 number, since 2×1110102002012 (a number of 23 digits) contains 22 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 not an unprimeable number, because it can be changed into a prime (111010200211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12659341 + ... + 12668106.
Almost surely, 2111010200201 is an apocalyptic number.
It is an amenable number.
111010200201 is a deficient number, since it is larger than the sum of its proper divisors (49667129911).
111010200201 is a wasteful number, since it uses less digits than its factorization.
111010200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25327940 (or 25327937 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111010200201 its reverse (102002010111), we get a palindrome (213012210312).
The spelling of 111010200201 in words is "one hundred eleven billion, ten million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •