Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …11000000110101110010010 |
3 | 2122112010020211020010011012 |
4 | 10211330321320012232102 |
5 | 10121430003230431002 |
6 | 110543502250050522 |
7 | 4153262561454044 |
oct | 445747170065622 |
9 | 78463224203135 |
10 | 20200202202002 |
11 | 6488948585629 |
12 | 2322b26a19a42 |
13 | b36b4247b564 |
14 | 4db9a3135a94 |
15 | 2506c0e4bd52 |
hex | 125f39e06b92 |
20200202202002 has 8 divisors (see below), whose sum is σ = 30457299693756. Its totient is φ = 10047768970752.
The previous prime is 20200202201983. The next prime is 20200202202077. The reversal of 20200202202002 is 20020220200202.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 16689259392001 + 3510942810001 = 4085249^2 + 1873751^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×202002022020022 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26166064643 + ... + 26166065414.
Almost surely, 220200202202002 is an apocalyptic number.
20200202202002 is a deficient number, since it is larger than the sum of its proper divisors (10257097491754).
20200202202002 is a wasteful number, since it uses less digits than its factorization.
20200202202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52332130252.
The product of its (nonzero) digits is 128, while the sum is 14.
Adding to 20200202202002 its reverse (20020220200202), we get a palindrome (40220422402204).
It can be divided in two parts, 20200 and 202202002, that added together give a palindrome (202222202).
The spelling of 20200202202002 in words is "twenty trillion, two hundred billion, two hundred two million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •