Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …001001111101100111011 |
3 | 21011022122202020000222001 |
4 | 131123110221033230323 |
5 | 231112432231224011 |
6 | 4144553055241431 |
7 | 266046025120414 |
oct | 35332451175473 |
9 | 7138582200861 |
10 | 2022202211131 |
11 | 70a67a47a703 |
12 | 287abb519277 |
13 | 118901265bcb |
14 | 6dc3742a80b |
15 | 379072507c1 |
hex | 1d6d4a4fb3b |
2022202211131 has 8 divisors (see below), whose sum is σ = 2141200681920. Its totient is φ = 1903208784768.
The previous prime is 2022202211111. The next prime is 2022202211201. The reversal of 2022202211131 is 1311122022202.
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 2022202211131 - 225 = 2022168656699 is a prime.
It is a super-2 number, since 2×20222022111312 (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 = 2022202211099 and 2022202211108.
It is not an unprimeable number, because it can be changed into a prime (2022202211111) 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, 419716 + ... + 2054401.
It is an arithmetic number, because the mean of its divisors is an integer number (267650085240).
Almost surely, 22022202211131 is an apocalyptic number.
2022202211131 is a deficient number, since it is larger than the sum of its proper divisors (118998470789).
2022202211131 is a wasteful number, since it uses less digits than its factorization.
2022202211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2522213.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2022202211131 its reverse (1311122022202), we get a palindrome (3333324233333).
The spelling of 2022202211131 in words is "two trillion, twenty-two billion, two hundred two million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •