Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …01001010001101101001000 |
3 | 2121211012011211220201001201 |
4 | 10203010200021101231020 |
5 | 10110204002203001300 |
6 | 110312515034353544 |
7 | 4133053132511350 |
oct | 443044011215510 |
9 | 77735154821051 |
10 | 20002202000200 |
11 | 6411982633412 |
12 | 22b0688b8b8b4 |
13 | b21279565934 |
14 | 4d217c899b60 |
15 | 24a48334a66a |
hex | 123120251b48 |
20002202000200 has 96 divisors (see below), whose sum is σ = 53217825091200. Its totient is φ = 6848979517440.
The previous prime is 20002202000177. The next prime is 20002202000219. The reversal of 20002202000200 is 200020220002.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8212924 + ... + 10366123.
It is an arithmetic number, because the mean of its divisors is an integer number (554352344700).
Almost surely, 220002202000200 is an apocalyptic number.
20002202000200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20002202000200 is an abundant number, since it is smaller than the sum of its proper divisors (33215623091000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002202000200 is a wasteful number, since it uses less digits than its factorization.
20002202000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18579839 (or 18579830 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 10.
Adding to 20002202000200 its reverse (200020220002), we get a palindrome (20202222220202).
It can be divided in two parts, 20002 and 202000200, that added together give a palindrome (202020202).
The spelling of 20002202000200 in words is "twenty trillion, two billion, two hundred two million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.640 sec. • engine limits •