Base | Representation |
---|---|
bin | 11110100011110111101… |
… | …110011111101000110011 |
3 | 21102202201121000221011100 |
4 | 132203313232133220303 |
5 | 233402001122413021 |
6 | 4244434523415443 |
7 | 304504304113551 |
oct | 36436756375063 |
9 | 7382647027140 |
10 | 2100100201011 |
11 | 73a7138a543a |
12 | 29b01b384583 |
13 | 123066a57c47 |
14 | 73906d54bd1 |
15 | 39965e0b626 |
hex | 1e8f7b9fa33 |
2100100201011 has 6 divisors (see below), whose sum is σ = 3033478068140. Its totient is φ = 1400066800668.
The previous prime is 2100100200971. The next prime is 2100100201049. The reversal of 2100100201011 is 1101020010012.
It is a happy number.
It is not a de Polignac number, because 2100100201011 - 27 = 2100100200883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 233344466779 = 2100100201011 / (2 + 1 + 0 + 0 + 1 + 0 + 0 + 2 + 0 + 1 + 0 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100100200984 and 2100100201002.
It is not an unprimeable number, because it can be changed into a prime (2100100241011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 116672233381 + ... + 116672233398.
Almost surely, 22100100201011 is an apocalyptic number.
2100100201011 is a deficient number, since it is larger than the sum of its proper divisors (933377867129).
2100100201011 is a wasteful number, since it uses less digits than its factorization.
2100100201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233344466785 (or 233344466782 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2100100201011 its reverse (1101020010012), we get a palindrome (3201120211023).
The spelling of 2100100201011 in words is "two trillion, one hundred billion, one hundred million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •