Base | Representation |
---|---|
bin | 1011101001110011011… |
… | …0011001010111111110 |
3 | 201010202021121210022200 |
4 | 2322130312121113332 |
5 | 11240002200013042 |
6 | 231545352452330 |
7 | 20315066634240 |
oct | 2723466312776 |
9 | 633667553280 |
10 | 200200001022 |
11 | 779a47549aa |
12 | 329726aa0a6 |
13 | 15b568a6a88 |
14 | 99928a4090 |
15 | 531accdc4c |
hex | 2e9cd995fe |
200200001022 has 96 divisors (see below), whose sum is σ = 499246517952. Its totient is φ = 56796083712.
The previous prime is 200200001017. The next prime is 200200001069. The reversal of 200200001022 is 220100002002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200200000995 and 200200001013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10216498 + ... + 10236074.
It is an arithmetic number, because the mean of its divisors is an integer number (5200484562).
Almost surely, 2200200001022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200200001022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249623258976).
200200001022 is an abundant number, since it is smaller than the sum of its proper divisors (299046516930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200200001022 is a wasteful number, since it uses less digits than its factorization.
200200001022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20162 (or 20159 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 200200001022 its reverse (220100002002), we get a palindrome (420300003024).
The spelling of 200200001022 in words is "two hundred billion, two hundred million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •