Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1001110001000000110 |
3 | 201010112201002100222000 |
4 | 2322120011032020012 |
5 | 11234321210013110 |
6 | 231533414050130 |
7 | 20313105641145 |
oct | 2723005161006 |
9 | 633481070860 |
10 | 200120001030 |
11 | 77963583804 |
12 | 3294b949946 |
13 | 15b431466c1 |
14 | 9985ddb75c |
15 | 5313c7a1c0 |
hex | 2e9814e206 |
200120001030 has 128 divisors (see below), whose sum is σ = 563905843200. Its totient is φ = 50398837632.
The previous prime is 200120001023. The next prime is 200120001031. The reversal of 200120001030 is 30100021002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200120001031) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 286632 + ... + 694548.
It is an arithmetic number, because the mean of its divisors is an integer number (4405514400).
Almost surely, 2200120001030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200120001030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (281952921600).
200120001030 is an abundant number, since it is smaller than the sum of its proper divisors (363785842170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200120001030 is a wasteful number, since it uses less digits than its factorization.
200120001030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408035 (or 408029 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 200120001030 its reverse (30100021002), we get a palindrome (230220022032).
The spelling of 200120001030 in words is "two hundred billion, one hundred twenty million, one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •