Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …010000111001110101101 |
3 | 21011022010201211010210101 |
4 | 131123020222013032231 |
5 | 231112024241040411 |
6 | 4144521113111101 |
7 | 266041033604464 |
oct | 35331052071655 |
9 | 7138121733711 |
10 | 2022001111981 |
11 | 70a586a06964 |
12 | 287a640b8491 |
13 | 11889b6b5526 |
14 | 6dc1883d9db |
15 | 378e477a8c1 |
hex | 1d6c8a873ad |
2022001111981 has 4 divisors (see below), whose sum is σ = 2060152076412. Its totient is φ = 1983850147552.
The previous prime is 2022001111969. The next prime is 2022001111997. The reversal of 2022001111981 is 1891111002202.
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 1327428883881 + 694572228100 = 1152141^2 + 833410^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022001111981 - 213 = 2022001103789 is a prime.
It is a super-2 number, since 2×20220011119812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022001111961) 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, 19075482136 + ... + 19075482241.
It is an arithmetic number, because the mean of its divisors is an integer number (515038019103).
Almost surely, 22022001111981 is an apocalyptic number.
It is an amenable number.
2022001111981 is a deficient number, since it is larger than the sum of its proper divisors (38150964431).
2022001111981 is an equidigital number, since it uses as much as digits as its factorization.
2022001111981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38150964430.
The product of its (nonzero) digits is 576, while the sum is 28.
The spelling of 2022001111981 in words is "two trillion, twenty-two billion, one million, one hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •