Base | Representation |
---|---|
bin | 1011010000000001… |
… | …1110000100000110 |
3 | 21210110201000101111 |
4 | 2310000132010012 |
5 | 22141111201042 |
6 | 1215401315234 |
7 | 134560522633 |
oct | 26400360406 |
9 | 7713630344 |
10 | 3020022022 |
11 | 130a7a6276 |
12 | 703495b1a |
13 | 3918a49a4 |
14 | 20913918a |
15 | 12a1eb517 |
hex | b401e106 |
3020022022 has 4 divisors (see below), whose sum is σ = 4530033036. Its totient is φ = 1510011010.
The previous prime is 3020022011. The next prime is 3020022023. The reversal of 3020022022 is 2202200203.
It is a semiprime because it is the product of two primes.
It is a Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 3020021993 and 3020022011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020022023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 755005504 + ... + 755005507.
It is an arithmetic number, because the mean of its divisors is an integer number (1132508259).
Almost surely, 23020022022 is an apocalyptic number.
3020022022 is a deficient number, since it is larger than the sum of its proper divisors (1510011014).
3020022022 is a wasteful number, since it uses less digits than its factorization.
3020022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510011013.
The product of its (nonzero) digits is 96, while the sum is 13.
The square root of 3020022022 is about 54954.7270214310. The cubic root of 3020022022 is about 1445.4509868123.
Adding to 3020022022 its reverse (2202200203), we get a palindrome (5222222225).
The spelling of 3020022022 in words is "three billion, twenty million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •