Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …111010111010101101010 |
3 | 11020201221010211210121011 |
4 | 101131301213113111222 |
5 | 124131003204121302 |
6 | 2315210514334134 |
7 | 152466060563143 |
oct | 21356147272552 |
9 | 4221833753534 |
10 | 1200202020202 |
11 | 423003829939 |
12 | 17473528a34a |
13 | 892423cb6a3 |
14 | 421392b4aca |
15 | 213477e35d7 |
hex | 117719d756a |
1200202020202 has 8 divisors (see below), whose sum is σ = 1800537681636. Its totient is φ = 600022792992.
The previous prime is 1200202020197. The next prime is 1200202020209. The reversal of 1200202020202 is 2020202020021.
It can be written as a sum of positive squares in 2 ways, for example, as 1183981195881 + 16220824321 = 1088109^2 + 127361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12002020202022 (a number of 25 digits) contains 22 as substring.
1200202020202 is a modest number, since divided by 2020202 gives 12002 as remainder.
It is not an unprimeable number, because it can be changed into a prime (1200202020209) by changing a digit.
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, 39089373 + ... + 39120064.
Almost surely, 21200202020202 is an apocalyptic number.
1200202020202 is a deficient number, since it is larger than the sum of its proper divisors (600335661434).
1200202020202 is an equidigital number, since it uses as much as digits as its factorization.
1200202020202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78217112.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 1200202020202 its reverse (2020202020021), we get a palindrome (3220404040223).
The spelling of 1200202020202 in words is "one trillion, two hundred billion, two hundred two million, twenty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •