Base | Representation |
---|---|
bin | 1011101001000100101… |
… | …1001000111011101111 |
3 | 201010020122000121020211 |
4 | 2322101023020323233 |
5 | 11234102023041421 |
6 | 231514114123251 |
7 | 20310200621446 |
oct | 2722113107357 |
9 | 633218017224 |
10 | 200004112111 |
11 | 7790411a741 |
12 | 32918b80527 |
13 | 15b2512ba8b |
14 | 9974871d5d |
15 | 53089d79e1 |
hex | 2e912c8eef |
200004112111 has 16 divisors (see below), whose sum is σ = 202807489248. Its totient is φ = 197216870400.
The previous prime is 200004112097. The next prime is 200004112151. The reversal of 200004112111 is 111211400002.
It is a cyclic number.
It is not a de Polignac number, because 200004112111 - 25 = 200004112079 is a prime.
It is a super-2 number, since 2×2000041121112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200004112091 and 200004112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200004112151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72966201 + ... + 72968941.
It is an arithmetic number, because the mean of its divisors is an integer number (12675468078).
Almost surely, 2200004112111 is an apocalyptic number.
200004112111 is a deficient number, since it is larger than the sum of its proper divisors (2803377137).
200004112111 is a wasteful number, since it uses less digits than its factorization.
200004112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5322.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200004112111 its reverse (111211400002), we get a palindrome (311215512113).
The spelling of 200004112111 in words is "two hundred billion, four million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •