Base | Representation |
---|---|
bin | 101110100100010011… |
… | …0001000001001011000 |
3 | 100120010022210020002200 |
4 | 1131020212020021120 |
5 | 3114301030432300 |
6 | 113535042130200 |
7 | 10140101456625 |
oct | 1351046101130 |
9 | 316108706080 |
10 | 100002202200 |
11 | 394576aa6aa |
12 | 1746a650960 |
13 | 9579100c14 |
14 | 4ba947534c |
15 | 2904522200 |
hex | 1748988258 |
100002202200 has 288 divisors, whose sum is σ = 365710410000. Its totient is φ = 24392309760.
The previous prime is 100002202199. The next prime is 100002202207. The reversal of 100002202200 is 2202200001.
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 (100002202207) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 941386 + ... + 1042214.
Almost surely, 2100002202200 is an apocalyptic number.
100002202200 is a gapful number since it is divisible by the number (10) 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 100002202200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182855205000).
100002202200 is an abundant number, since it is smaller than the sum of its proper divisors (265708207800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002202200 is a wasteful number, since it uses less digits than its factorization.
100002202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100899 (or 100887 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 100002202200 its reverse (2202200001), we get a palindrome (102204402201).
The spelling of 100002202200 in words is "one hundred billion, two million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •