Base | Representation |
---|---|
bin | 1011101001000100000… |
… | …0000010001111010111 |
3 | 201010020102112201010000 |
4 | 2322101000002033113 |
5 | 11234100301413421 |
6 | 231513531502343 |
7 | 20310134105535 |
oct | 2722100021727 |
9 | 633212481100 |
10 | 200001201111 |
11 | 77902511658 |
12 | 32917bb79b3 |
13 | 15b2464caaa |
14 | 9974315155 |
15 | 5308610226 |
hex | 2e910023d7 |
200001201111 has 40 divisors (see below), whose sum is σ = 301259496384. Its totient is φ = 132225825600.
The previous prime is 200001201091. The next prime is 200001201139. The reversal of 200001201111 is 111102100002.
It is a happy number.
It is not a de Polignac number, because 200001201111 - 26 = 200001201047 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 = 200001201093 and 200001201102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001201311) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5545186 + ... + 5581136.
Almost surely, 2200001201111 is an apocalyptic number.
200001201111 is a deficient number, since it is larger than the sum of its proper divisors (101258295273).
200001201111 is a wasteful number, since it uses less digits than its factorization.
200001201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36533 (or 36524 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200001201111 its reverse (111102100002), we get a palindrome (311103301113).
The spelling of 200001201111 in words is "two hundred billion, one million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •