Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …000101101110111111111 |
3 | 21002012101010200102020221 |
4 | 131012221320231313333 |
5 | 230232010030310421 |
6 | 4130443015322211 |
7 | 264332053406041 |
oct | 35065170556777 |
9 | 7065333612227 |
10 | 2000010010111 |
11 | 701221568603 |
12 | 283747380367 |
13 | 1167a565a709 |
14 | 6cb2dd37a91 |
15 | 37058d08841 |
hex | 1d1a9e2ddff |
2000010010111 has 4 divisors (see below), whose sum is σ = 2000287065400. Its totient is φ = 1999732954824.
The previous prime is 2000010010051. The next prime is 2000010010123. The reversal of 2000010010111 is 1110100100002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2000010010111 - 213 = 2000010001919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000010010094 and 2000010010103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000010010211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138516816 + ... + 138531253.
It is an arithmetic number, because the mean of its divisors is an integer number (500071766350).
Almost surely, 22000010010111 is an apocalyptic number.
2000010010111 is a deficient number, since it is larger than the sum of its proper divisors (277055289).
2000010010111 is an equidigital number, since it uses as much as digits as its factorization.
2000010010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277055288.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 2000010010111 its reverse (1110100100002), we get a palindrome (3110110110113).
The spelling of 2000010010111 in words is "two trillion, ten million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •