Base | Representation |
---|---|
bin | 11110101110000111011… |
… | …011010000010100001101 |
3 | 21110211010020222222210020 |
4 | 132232013123100110031 |
5 | 234042013324324323 |
6 | 4253454301132353 |
7 | 305344023342525 |
oct | 36560733202415 |
9 | 7424106888706 |
10 | 2111101011213 |
11 | 744349536a17 |
12 | 2a118b55a0b9 |
13 | 1240caba72ac |
14 | 7426bd96685 |
15 | 39dabaaaae3 |
hex | 1eb876d050d |
2111101011213 has 4 divisors (see below), whose sum is σ = 2814801348288. Its totient is φ = 1407400674140.
The previous prime is 2111101011211. The next prime is 2111101011301. The reversal of 2111101011213 is 3121101011112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2111101011213 - 21 = 2111101011211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2111101011192 and 2111101011201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111101011211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 351850168533 + ... + 351850168538.
It is an arithmetic number, because the mean of its divisors is an integer number (703700337072).
Almost surely, 22111101011213 is an apocalyptic number.
It is an amenable number.
2111101011213 is a deficient number, since it is larger than the sum of its proper divisors (703700337075).
2111101011213 is an equidigital number, since it uses as much as digits as its factorization.
2111101011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703700337074.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 2111101011213 its reverse (3121101011112), we get a palindrome (5232202022325).
The spelling of 2111101011213 in words is "two trillion, one hundred eleven billion, one hundred one million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •