Base | Representation |
---|---|
bin | 10001011101101011100… |
… | …010100101000000111000 |
3 | 11020201200001001211101100 |
4 | 101131223202211000320 |
5 | 124130301111232300 |
6 | 2315152434051400 |
7 | 152463412362126 |
oct | 21355342450070 |
9 | 4221601054340 |
10 | 1200100102200 |
11 | 422a6124838a |
12 | 174707119b60 |
13 | 89227265b8c |
14 | 42129944916 |
15 | 2133d8b0700 |
hex | 1176b8a5038 |
1200100102200 has 288 divisors, whose sum is σ = 4146724436400. Its totient is φ = 310853376000.
The previous prime is 1200100102181. The next prime is 1200100102217. The reversal of 1200100102200 is 22010010021.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 16864695 + ... + 16935705.
Almost surely, 21200100102200 is an apocalyptic number.
1200100102200 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 1200100102200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2073362218200).
1200100102200 is an abundant number, since it is smaller than the sum of its proper divisors (2946624334200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200100102200 is a wasteful number, since it uses less digits than its factorization.
1200100102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71303 (or 71291 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1200100102200 its reverse (22010010021), we get a palindrome (1222110112221).
The spelling of 1200100102200 in words is "one trillion, two hundred billion, one hundred million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •