Base | Representation |
---|---|
bin | 11110100011110001110… |
… | …000101011110110001011 |
3 | 21102202110121200212212100 |
4 | 132203301300223312023 |
5 | 233401300012041021 |
6 | 4244420550244443 |
7 | 304501650301104 |
oct | 36436160536613 |
9 | 7382417625770 |
10 | 2100000112011 |
11 | 73a67235305a |
12 | 29abb1956723 |
13 | 12304c0b2a99 |
14 | 738d793d3ab |
15 | 3995c23a626 |
hex | 1e8f1c2bd8b |
2100000112011 has 12 divisors (see below), whose sum is σ = 3034109136240. Its totient is φ = 1399642086480.
The previous prime is 2100000111973. The next prime is 2100000112039. The reversal of 2100000112011 is 1102110000012.
It is a happy number.
It is not a de Polignac number, because 2100000112011 - 29 = 2100000111499 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 = 2100000111984 and 2100000112002.
It is not an unprimeable number, because it can be changed into a prime (2100000110011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29795196 + ... + 29865593.
It is an arithmetic number, because the mean of its divisors is an integer number (252842428020).
Almost surely, 22100000112011 is an apocalyptic number.
2100000112011 is a deficient number, since it is larger than the sum of its proper divisors (934109024229).
2100000112011 is a wasteful number, since it uses less digits than its factorization.
2100000112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59664706 (or 59664703 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2100000112011 its reverse (1102110000012), we get a palindrome (3202110112023).
The spelling of 2100000112011 in words is "two trillion, one hundred billion, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •