Base | Representation |
---|---|
bin | 10001011101101011101… |
… | …001110111000101000000 |
3 | 11020201200011122211001001 |
4 | 101131223221313011000 |
5 | 124130302103324300 |
6 | 2315152543021344 |
7 | 152463434532541 |
oct | 21355351670500 |
9 | 4221604584031 |
10 | 1200102011200 |
11 | 422a62331674 |
12 | 17470789a854 |
13 | 89227783a71 |
14 | 42129cc04c8 |
15 | 2133db3b16a |
hex | 1176ba77140 |
1200102011200 has 42 divisors (see below), whose sum is σ = 2953001015246. Its totient is φ = 480040803840.
The previous prime is 1200102011189. The next prime is 1200102011209. The reversal of 1200102011200 is 21102010021.
It can be written as a sum of positive squares in 3 ways, for example, as 68125176064 + 1131976835136 = 261008^2 + 1063944^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200102011209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 375030279 + ... + 375033478.
Almost surely, 21200102011200 is an apocalyptic number.
1200102011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200102011200 is an abundant number, since it is smaller than the sum of its proper divisors (1752899004046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200102011200 is an equidigital number, since it uses as much as digits as its factorization.
1200102011200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750063779 (or 750063764 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1200102011200 its reverse (21102010021), we get a palindrome (1221204021221).
The spelling of 1200102011200 in words is "one trillion, two hundred billion, one hundred two million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •