Base | Representation |
---|---|
bin | 100111001000101110… |
… | …011011011111101111 |
3 | 11000110121102001011100 |
4 | 213020232123133233 |
5 | 1142030203220421 |
6 | 31145500054143 |
7 | 3015231553542 |
oct | 471056333757 |
9 | 130417361140 |
10 | 42022320111 |
11 | 16904560082 |
12 | 8189234353 |
13 | 3c69043095 |
14 | 2068dd6859 |
15 | 115e307c26 |
hex | 9c8b9b7ef |
42022320111 has 12 divisors (see below), whose sum is σ = 64269430992. Its totient is φ = 26366945856.
The previous prime is 42022320101. The next prime is 42022320113. The reversal of 42022320111 is 11102322024.
It is a happy number.
42022320111 is a `hidden beast` number, since 420 + 2 + 232 + 0 + 1 + 11 = 666.
It is not a de Polignac number, because 42022320111 - 214 = 42022303727 is a prime.
It is a super-2 number, since 2×420223201112 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42022320113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 137327691 + ... + 137327996.
It is an arithmetic number, because the mean of its divisors is an integer number (5355785916).
Almost surely, 242022320111 is an apocalyptic number.
42022320111 is a deficient number, since it is larger than the sum of its proper divisors (22247110881).
42022320111 is a wasteful number, since it uses less digits than its factorization.
42022320111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274655710 (or 274655707 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 42022320111 its reverse (11102322024), we get a palindrome (53124642135).
The spelling of 42022320111 in words is "forty-two billion, twenty-two million, three hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •