Base | Representation |
---|---|
bin | 111011101010111… |
… | …1101000110110110 |
3 | 12011112120112110000 |
4 | 1313111331012312 |
5 | 13100033302042 |
6 | 530403012130 |
7 | 100421536062 |
oct | 16725750666 |
9 | 5145515400 |
10 | 2002244022 |
11 | 93823a629 |
12 | 47a66a046 |
13 | 25ba8189c |
14 | 14dcc0aa2 |
15 | baba774c |
hex | 7757d1b6 |
2002244022 has 20 divisors (see below), whose sum is σ = 4486510116. Its totient is φ = 667414620.
The previous prime is 2002244021. The next prime is 2002244029. The reversal of 2002244022 is 2204422002.
2002244022 is a `hidden beast` number, since 200 + 2 + 2 + 440 + 22 = 666.
It is a super-2 number, since 2×20022440222 = 8017962247269472968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2002243986 and 2002244004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002244021) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6179604 + ... + 6179927.
Almost surely, 22002244022 is an apocalyptic number.
2002244022 is an abundant number, since it is smaller than the sum of its proper divisors (2484266094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002244022 is a wasteful number, since it uses less digits than its factorization.
2002244022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12359545 (or 12359536 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
The square root of 2002244022 is about 44746.4414451026. The cubic root of 2002244022 is about 1260.3920888608.
Adding to 2002244022 its reverse (2204422002), we get a palindrome (4206666024).
The spelling of 2002244022 in words is "two billion, two million, two hundred forty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •