Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1001100011111011100 |
3 | 201010210200111121200002 |
4 | 2322132003030133130 |
5 | 11240022323231330 |
6 | 231551352153432 |
7 | 20315433024113 |
oct | 2723603143734 |
9 | 633720447602 |
10 | 200220133340 |
11 | 77a05055687 |
12 | 32979398878 |
13 | 15b5ab054a6 |
14 | 9995424c7a |
15 | 531c958e45 |
hex | 2e9e0cc7dc |
200220133340 has 12 divisors (see below), whose sum is σ = 420462280056. Its totient is φ = 80088053328.
The previous prime is 200220133319. The next prime is 200220133381. The reversal of 200220133340 is 43331022002.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 10011006667 = 200220133340 / (2 + 0 + 0 + 2 + 2 + 0 + 1 + 3 + 3 + 3 + 4 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005503314 + ... + 5005503353.
It is an arithmetic number, because the mean of its divisors is an integer number (35038523338).
Almost surely, 2200220133340 is an apocalyptic number.
200220133340 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200220133340 is an abundant number, since it is smaller than the sum of its proper divisors (220242146716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200220133340 is a wasteful number, since it uses less digits than its factorization.
200220133340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011006676 (or 10011006674 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 200220133340 its reverse (43331022002), we get a palindrome (243551155342).
The spelling of 200220133340 in words is "two hundred billion, two hundred twenty million, one hundred thirty-three thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •