Base | Representation |
---|---|
bin | 111100110111000… |
… | …0100011101010110 |
3 | 12021022121110000220 |
4 | 1321232010131112 |
5 | 13140240320042 |
6 | 534345415210 |
7 | 101414506455 |
oct | 17156043526 |
9 | 5238543026 |
10 | 2042120022 |
11 | 9587a5aa8 |
12 | 48ba9a506 |
13 | 267103b57 |
14 | 155300b9c |
15 | be4328ec |
hex | 79b84756 |
2042120022 has 8 divisors (see below), whose sum is σ = 4084240056. Its totient is φ = 680706672.
The previous prime is 2042119993. The next prime is 2042120027. The reversal of 2042120022 is 2200212402.
It is a sphenic number, since it is the product of 3 distinct primes.
2042120022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2042119983 and 2042120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042120027) 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, 170176663 + ... + 170176674.
It is an arithmetic number, because the mean of its divisors is an integer number (510530007).
Almost surely, 22042120022 is an apocalyptic number.
2042120022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2042120022 is a wasteful number, since it uses less digits than its factorization.
2042120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340353342.
The product of its (nonzero) digits is 128, while the sum is 15.
The square root of 2042120022 is about 45189.8221063106. The cubic root of 2042120022 is about 1268.7043272096.
Adding to 2042120022 its reverse (2200212402), we get a palindrome (4242332424).
The spelling of 2042120022 in words is "two billion, forty-two million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •