Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …110010111011011111111 |
3 | 21002022012020110202122101 |
4 | 131013222332113123333 |
5 | 230241224103310421 |
6 | 4131143224525531 |
7 | 264401113302361 |
oct | 35075276273377 |
9 | 7068166422571 |
10 | 2001102010111 |
11 | 701731a09346 |
12 | 2839b10208a7 |
13 | 11691a969c69 |
14 | 6cbd4d92d31 |
15 | 370beb0e191 |
hex | 1d1eaf976ff |
2001102010111 has 8 divisors (see below), whose sum is σ = 2049247272960. Its totient is φ = 1953188773368.
The previous prime is 2001102010109. The next prime is 2001102010147. The reversal of 2001102010111 is 1110102011002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001102010111 - 21 = 2001102010109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001102910111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57989071 + ... + 58023568.
It is an arithmetic number, because the mean of its divisors is an integer number (256155909120).
Almost surely, 22001102010111 is an apocalyptic number.
2001102010111 is a deficient number, since it is larger than the sum of its proper divisors (48145262849).
2001102010111 is a wasteful number, since it uses less digits than its factorization.
2001102010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116013053.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2001102010111 its reverse (1110102011002), we get a palindrome (3111204021113).
The spelling of 2001102010111 in words is "two trillion, one billion, one hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •