Base | Representation |
---|---|
bin | 111100010000111… |
… | …0111100101010101 |
3 | 12012221000120112212 |
4 | 1320201313211111 |
5 | 13120132104331 |
6 | 532353323205 |
7 | 101052641360 |
oct | 17041674525 |
9 | 5187016485 |
10 | 2022144341 |
11 | 9484a1a78 |
12 | 485266505 |
13 | 262c2b819 |
14 | 1527c10d7 |
15 | bc7d8d2b |
hex | 78877955 |
2022144341 has 4 divisors (see below), whose sum is σ = 2311022112. Its totient is φ = 1733266572.
The previous prime is 2022144329. The next prime is 2022144343. The reversal of 2022144341 is 1434412202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2022144341 - 218 = 2021882197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022144343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 144438875 + ... + 144438888.
It is an arithmetic number, because the mean of its divisors is an integer number (577755528).
Almost surely, 22022144341 is an apocalyptic number.
It is an amenable number.
2022144341 is a deficient number, since it is larger than the sum of its proper divisors (288877771).
2022144341 is an equidigital number, since it uses as much as digits as its factorization.
2022144341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288877770.
The product of its (nonzero) digits is 1536, while the sum is 23.
The square root of 2022144341 is about 44968.2592613946. The cubic root of 2022144341 is about 1264.5540129766.
Adding to 2022144341 its reverse (1434412202), we get a palindrome (3456556543).
The spelling of 2022144341 in words is "two billion, twenty-two million, one hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •