Base | Representation |
---|---|
bin | 101101100001010011110100… |
… | …110000101111101101101000 |
3 | 222020212001002102012021102112 |
4 | 231201103310300233231220 |
5 | 202220043344214121300 |
6 | 1545443043100221452 |
7 | 60112024302266450 |
oct | 5541236460575550 |
9 | 866761072167375 |
10 | 200201122020200 |
11 | 58876901169974 |
12 | 1a55439a83a888 |
13 | 8792b66b9b822 |
14 | 3761b00b36d60 |
15 | 1822a55c98e35 |
hex | b614f4c2fb68 |
200201122020200 has 48 divisors (see below), whose sum is σ = 531962981371680. Its totient is φ = 68640384692160.
The previous prime is 200201122020187. The next prime is 200201122020281. The reversal of 200201122020200 is 2020221102002.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71500399322 + ... + 71500402121.
It is an arithmetic number, because the mean of its divisors is an integer number (11082562111910).
Almost surely, 2200201122020200 is an apocalyptic number.
200201122020200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200201122020200 is an abundant number, since it is smaller than the sum of its proper divisors (331761859351480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200201122020200 is a wasteful number, since it uses less digits than its factorization.
200201122020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143000801466 (or 143000801457 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200201122020200 its reverse (2020221102002), we get a palindrome (202221343122202).
The spelling of 200201122020200 in words is "two hundred trillion, two hundred one billion, one hundred twenty-two million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •