Base | Representation |
---|---|
bin | 11110101110001101010… |
… | …101101101111110011001 |
3 | 21110211101011200110221122 |
4 | 132232031111231332121 |
5 | 234042214224120004 |
6 | 4253512203415025 |
7 | 305346336543224 |
oct | 36561525557631 |
9 | 7424334613848 |
10 | 2111200223129 |
11 | 74439a53a338 |
12 | 2a11b8824475 |
13 | 12411560317a |
14 | 7427b2205bb |
15 | 39db5656cbe |
hex | 1eb8d56df99 |
2111200223129 has 4 divisors (see below), whose sum is σ = 2162692911540. Its totient is φ = 2059707534720.
The previous prime is 2111200223107. The next prime is 2111200223147. The reversal of 2111200223129 is 9213220021112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 424123957504 + 1687076265625 = 651248^2 + 1298875^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111200223129 - 228 = 2110931787673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2111200223098 and 2111200223107.
It is not an unprimeable number, because it can be changed into a prime (2111200223189) 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, 25746344144 + ... + 25746344225.
It is an arithmetic number, because the mean of its divisors is an integer number (540673227885).
Almost surely, 22111200223129 is an apocalyptic number.
It is an amenable number.
2111200223129 is a deficient number, since it is larger than the sum of its proper divisors (51492688411).
2111200223129 is an equidigital number, since it uses as much as digits as its factorization.
2111200223129 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51492688410.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 2111200223129 in words is "two trillion, one hundred eleven billion, two hundred million, two hundred twenty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •