Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …0100101101101001111 |
3 | 201010202100200121222200 |
4 | 2322130322211231033 |
5 | 11240002440200421 |
6 | 231545432212543 |
7 | 20315112162465 |
oct | 2723472455517 |
9 | 633670617880 |
10 | 200201100111 |
11 | 779a5335741 |
12 | 32972b3a153 |
13 | 15b56ba011c |
14 | 9992aac835 |
15 | 531ae49726 |
hex | 2e9cea5b4f |
200201100111 has 48 divisors (see below), whose sum is σ = 303295629312. Its totient is φ = 127013040000.
The previous prime is 200201100097. The next prime is 200201100179. The reversal of 200201100111 is 111001102002.
It is a happy number.
It is not a de Polignac number, because 200201100111 - 27 = 200201099983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200201100093 and 200201100102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201100181) 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 47 ways as a sum of consecutive naturals, for example, 43681126 + ... + 43685708.
It is an arithmetic number, because the mean of its divisors is an integer number (6318658944).
Almost surely, 2200201100111 is an apocalyptic number.
200201100111 is a deficient number, since it is larger than the sum of its proper divisors (103094529201).
200201100111 is a wasteful number, since it uses less digits than its factorization.
200201100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5644 (or 5641 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200201100111 its reverse (111001102002), we get a palindrome (311202202113).
The spelling of 200201100111 in words is "two hundred billion, two hundred one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •