Base | Representation |
---|---|
bin | 1011101001001000111… |
… | …1011100111110100000 |
3 | 201010021212201102020222 |
4 | 2322102033130332200 |
5 | 11234121114120000 |
6 | 231515554022212 |
7 | 20310506055155 |
oct | 2722217347640 |
9 | 633255642228 |
10 | 200022020000 |
11 | 77913241150 |
12 | 32922b77968 |
13 | 15b28a5bb6a |
14 | 9976db422c |
15 | 530a373a85 |
hex | 2e923dcfa0 |
200022020000 has 240 divisors, whose sum is σ = 539016109632. Its totient is φ = 72437760000.
The previous prime is 200022019997. The next prime is 200022020039. The reversal of 200022020000 is 20220002.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 200022020000.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 57858272 + ... + 57861728.
Almost surely, 2200022020000 is an apocalyptic number.
200022020000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200022020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (269508054816).
200022020000 is an abundant number, since it is smaller than the sum of its proper divisors (338994089632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200022020000 is a wasteful number, since it uses less digits than its factorization.
200022020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3761 (or 3738 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 8.
Adding to 200022020000 its reverse (20220002), we get a palindrome (200042240002).
The spelling of 200022020000 in words is "two hundred billion, twenty-two million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •