Base | Representation |
---|---|
bin | 11110100011111000010… |
… | …100010000101000010011 |
3 | 21102202202021122220102000 |
4 | 132203320110100220103 |
5 | 233402011141213021 |
6 | 4244435515525043 |
7 | 304504454215536 |
oct | 36437024205023 |
9 | 7382667586360 |
10 | 2100110101011 |
11 | 73a71944745a |
12 | 29b022759783 |
13 | 123068b13130 |
14 | 739083b0a1d |
15 | 39966c14b26 |
hex | 1e8f8510a13 |
2100110101011 has 64 divisors (see below), whose sum is σ = 3414936067200. Its totient is φ = 1267577206272.
The previous prime is 2100110101007. The next prime is 2100110101087. The reversal of 2100110101011 is 1101010110012.
It is not a de Polignac number, because 2100110101011 - 22 = 2100110101007 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 = 2100110100984 and 2100110101002.
It is not an unprimeable number, because it can be changed into a prime (2100110101211) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 62731185 + ... + 62764653.
It is an arithmetic number, because the mean of its divisors is an integer number (53358376050).
Almost surely, 22100110101011 is an apocalyptic number.
2100110101011 is a deficient number, since it is larger than the sum of its proper divisors (1314825966189).
2100110101011 is a wasteful number, since it uses less digits than its factorization.
2100110101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36917 (or 36911 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2100110101011 its reverse (1101010110012), we get a palindrome (3201120211023).
Subtracting from 2100110101011 its reverse (1101010110012), we obtain a palindrome (999099990999).
The spelling of 2100110101011 in words is "two trillion, one hundred billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •