Base | Representation |
---|---|
bin | 11101011011001111001… |
… | …101010011101000101011 |
3 | 21011022102101121002100220 |
4 | 131123033031103220223 |
5 | 231112240404014011 |
6 | 4144540040301123 |
7 | 266043536625144 |
oct | 35331715235053 |
9 | 7138371532326 |
10 | 2022111001131 |
11 | 70a632a42241 |
12 | 287a94a717a3 |
13 | 1188b83ac2b0 |
14 | 6dc29286acb |
15 | 378ee235506 |
hex | 1d6cf353a2b |
2022111001131 has 8 divisors (see below), whose sum is σ = 2903544001680. Its totient is φ = 1244376000672.
The previous prime is 2022111001093. The next prime is 2022111001139. The reversal of 2022111001131 is 1311001112202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2022111001131 - 29 = 2022111000619 is a prime.
It is a super-2 number, since 2×20221110011312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2022111001131.
It is not an unprimeable number, because it can be changed into a prime (2022111001139) 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, 25924499976 + ... + 25924500053.
It is an arithmetic number, because the mean of its divisors is an integer number (362943000210).
Almost surely, 22022111001131 is an apocalyptic number.
2022111001131 is a deficient number, since it is larger than the sum of its proper divisors (881433000549).
2022111001131 is a wasteful number, since it uses less digits than its factorization.
2022111001131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51849000045.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2022111001131 its reverse (1311001112202), we get a palindrome (3333112113333).
The spelling of 2022111001131 in words is "two trillion, twenty-two billion, one hundred eleven million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •