Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …10100101000110011110111 |
3 | 2121211000000022222200210000 |
4 | 10203002220310220303313 |
5 | 10110140402211213421 |
6 | 110311544243002343 |
7 | 4132652413610016 |
oct | 443025064506367 |
9 | 77730008880700 |
10 | 20000200101111 |
11 | 6411045609a5a |
12 | 22b020a6693b3 |
13 | b2101a8a5069 |
14 | 4d202ca68a7d |
15 | 24a3b7710226 |
hex | 1230a8d28cf7 |
20000200101111 has 20 divisors (see below), whose sum is σ = 29877278013000. Its totient is φ = 13333272206256.
The previous prime is 20000200101103. The next prime is 20000200101131. The reversal of 20000200101111 is 11110100200002.
It is a happy number.
It is not a de Polignac number, because 20000200101111 - 23 = 20000200101103 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 = 20000200101093 and 20000200101102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000200101131) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3895585 + ... + 7428053.
It is an arithmetic number, because the mean of its divisors is an integer number (1493863900650).
Almost surely, 220000200101111 is an apocalyptic number.
20000200101111 is a deficient number, since it is larger than the sum of its proper divisors (9877077911889).
20000200101111 is an equidigital number, since it uses as much as digits as its factorization.
20000200101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3602380 (or 3602371 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20000200101111 its reverse (11110100200002), we get a palindrome (31110300301113).
The spelling of 20000200101111 in words is "twenty trillion, two hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •