Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …00010110010001001100010 |
3 | 2122121000220220122210110021 |
4 | 10212033203002302021202 |
5 | 10122242002334020002 |
6 | 111001012501424054 |
7 | 4154601623013415 |
oct | 446174302621142 |
9 | 78530826583407 |
10 | 20220220220002 |
11 | 64963901a0860 |
12 | 2326992a0b02a |
13 | b389b27c441a |
14 | 4dc94198bb7c |
15 | 250e93576737 |
hex | 1263e30b2262 |
20220220220002 has 16 divisors (see below), whose sum is σ = 33459404248800. Its totient is φ = 9087739423840.
The previous prime is 20220220219993. The next prime is 20220220220003. The reversal of 20220220220002 is 20002202202202.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (20220220220003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5163486352 + ... + 5163490267.
It is an arithmetic number, because the mean of its divisors is an integer number (2091212765550).
Almost surely, 220220220220002 is an apocalyptic number.
20220220220002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20220220220002 is a deficient number, since it is larger than the sum of its proper divisors (13239184028798).
20220220220002 is a wasteful number, since it uses less digits than its factorization.
20220220220002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10326976721.
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 20220220220002 its reverse (20002202202202), we get a palindrome (40222422422204).
It can be divided in two parts, 202202202 and 20002, that multiplied together give a palindrome (4044448444404).
The spelling of 20220220220002 in words is "twenty trillion, two hundred twenty billion, two hundred twenty million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •