Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …001001110110000100001 |
3 | 21011022122121021021220120 |
4 | 131123110201032300201 |
5 | 231112431212010423 |
6 | 4144552542230453 |
7 | 266046001220121 |
oct | 35332441166041 |
9 | 7138577237816 |
10 | 2022200110113 |
11 | 70a679275127 |
12 | 287aba885429 |
13 | 1189009ab7c1 |
14 | 6dc37040c81 |
15 | 37906e87ee3 |
hex | 1d6d484ec21 |
2022200110113 has 8 divisors (see below), whose sum is σ = 2705862070176. Its totient is φ = 1343335778400.
The previous prime is 2022200110103. The next prime is 2022200110129. The reversal of 2022200110113 is 3110110022202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2022200110113 - 25 = 2022200110081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022200110092 and 2022200110101.
It is not an unprimeable number, because it can be changed into a prime (2022200110103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1199406103 + ... + 1199407788.
It is an arithmetic number, because the mean of its divisors is an integer number (338232758772).
Almost surely, 22022200110113 is an apocalyptic number.
It is an amenable number.
2022200110113 is a deficient number, since it is larger than the sum of its proper divisors (683661960063).
2022200110113 is a wasteful number, since it uses less digits than its factorization.
2022200110113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2398814175.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2022200110113 its reverse (3110110022202), we get a palindrome (5132310132315).
The spelling of 2022200110113 in words is "two trillion, twenty-two billion, two hundred million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •