Base | Representation |
---|---|
bin | 11101011001011101111… |
… | …110001001011111010010 |
3 | 21011010111222210021220012 |
4 | 131121131332021133102 |
5 | 231044343031431002 |
6 | 4144023333114522 |
7 | 265645500613160 |
oct | 35313576113722 |
9 | 7133458707805 |
10 | 2020211202002 |
11 | 709848614014 |
12 | 287644788a42 |
13 | 118674918cb6 |
14 | 6dac8c32230 |
15 | 3783c566d52 |
hex | 1d65df897d2 |
2020211202002 has 8 divisors (see below), whose sum is σ = 3463219203456. Its totient is φ = 865804800852.
The previous prime is 2020211202001. The next prime is 2020211202041. The reversal of 2020211202002 is 2002021120202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 144300800143 = 2020211202002 / (2 + 0 + 2 + 0 + 2 + 1 + 1 + 2 + 0 + 2 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (2020211202001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72150400058 + ... + 72150400085.
It is an arithmetic number, because the mean of its divisors is an integer number (432902400432).
Almost surely, 22020211202002 is an apocalyptic number.
2020211202002 is a deficient number, since it is larger than the sum of its proper divisors (1443008001454).
2020211202002 is a wasteful number, since it uses less digits than its factorization.
2020211202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144300800152.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 2020211202002 its reverse (2002021120202), we get a palindrome (4022232322204).
It can be divided in two parts, 202021120200 and 2, that added together give a palindrome (202021120202).
The spelling of 2020211202002 in words is "two trillion, twenty billion, two hundred eleven million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •