Base | Representation |
---|---|
bin | 11110101101001011111… |
… | …000010111110010000011 |
3 | 21110201112122012112010202 |
4 | 132231023320113302003 |
5 | 234032442103323021 |
6 | 4253211213115415 |
7 | 305310203104511 |
oct | 36551370276203 |
9 | 7421478175122 |
10 | 2110102011011 |
11 | 743986636315 |
12 | 2a0b50a88b6b |
13 | 123c9bc2a207 |
14 | 741b54294b1 |
15 | 39d4e025a0b |
hex | 1eb4be17c83 |
2110102011011 has 8 divisors (see below), whose sum is σ = 2115556896000. Its totient is φ = 2104649225280.
The previous prime is 2110102011007. The next prime is 2110102011029. The reversal of 2110102011011 is 1101102010112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2110102011011 - 22 = 2110102011007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2110102010983 and 2110102011001.
It is not an unprimeable number, because it can be changed into a prime (2110102011041) 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 7 ways as a sum of consecutive naturals, for example, 1498175 + ... + 2542583.
It is an arithmetic number, because the mean of its divisors is an integer number (264444612000).
Almost surely, 22110102011011 is an apocalyptic number.
2110102011011 is a deficient number, since it is larger than the sum of its proper divisors (5454884989).
2110102011011 is a wasteful number, since it uses less digits than its factorization.
2110102011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049629.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2110102011011 its reverse (1101102010112), we get a palindrome (3211204021123).
The spelling of 2110102011011 in words is "two trillion, one hundred ten billion, one hundred two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •