Base | Representation |
---|---|
bin | 11110100101101110111… |
… | …111000001000110111001 |
3 | 21102221220000221010100120 |
4 | 132211232333001012321 |
5 | 233420100330133423 |
6 | 4245405240123453 |
7 | 304605010602402 |
oct | 36455677010671 |
9 | 7387800833316 |
10 | 2102101021113 |
11 | 740550252175 |
12 | 29b499466589 |
13 | 1232c542b672 |
14 | 73a569849a9 |
15 | 39a318d1ee3 |
hex | 1e96efc11b9 |
2102101021113 has 4 divisors (see below), whose sum is σ = 2802801361488. Its totient is φ = 1401400680740.
The previous prime is 2102101021109. The next prime is 2102101021147. The reversal of 2102101021113 is 3111201012012.
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 2102101021113 - 22 = 2102101021109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102101021092 and 2102101021101.
It is not an unprimeable number, because it can be changed into a prime (2102101021613) 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, 350350170183 + ... + 350350170188.
It is an arithmetic number, because the mean of its divisors is an integer number (700700340372).
Almost surely, 22102101021113 is an apocalyptic number.
It is an amenable number.
2102101021113 is a deficient number, since it is larger than the sum of its proper divisors (700700340375).
2102101021113 is an equidigital number, since it uses as much as digits as its factorization.
2102101021113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700700340374.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2102101021113 its reverse (3111201012012), we get a palindrome (5213302033125).
The spelling of 2102101021113 in words is "two trillion, one hundred two billion, one hundred one million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •