Base | Representation |
---|---|
bin | 11110101110000001100… |
… | …001111100100101101011 |
3 | 21110210212100212220000121 |
4 | 132232001201330211223 |
5 | 234041313014231443 |
6 | 4253440405144111 |
7 | 305341412543035 |
oct | 36560141744553 |
9 | 7423770786017 |
10 | 2111002102123 |
11 | 7442a8720072 |
12 | 2a11623bb037 |
13 | 1240b35561c5 |
14 | 7425cbaac55 |
15 | 39da306e4ed |
hex | 1eb8187c96b |
2111002102123 has 8 divisors (see below), whose sum is σ = 2111730266016. Its totient is φ = 2110274040000.
The previous prime is 2111002102049. The next prime is 2111002102133. The reversal of 2111002102123 is 3212012001112.
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 2111002102123 - 229 = 2110465231211 is a prime.
It is a super-2 number, since 2×21110021021232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2111002102097 and 2111002102106.
It is not an unprimeable number, because it can be changed into a prime (2111002102133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81113853 + ... + 81139873.
It is an arithmetic number, because the mean of its divisors is an integer number (263966283252).
Almost surely, 22111002102123 is an apocalyptic number.
2111002102123 is a deficient number, since it is larger than the sum of its proper divisors (728163893).
2111002102123 is a wasteful number, since it uses less digits than its factorization.
2111002102123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50885.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2111002102123 its reverse (3212012001112), we get a palindrome (5323014103235).
The spelling of 2111002102123 in words is "two trillion, one hundred eleven billion, two million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •