Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …000000111011110001000 |
3 | 11020201221000021021021201 |
4 | 101131301200013132020 |
5 | 124131002212321300 |
6 | 2315210405513544 |
7 | 152466035460604 |
oct | 21356140073610 |
9 | 4221830237251 |
10 | 1200200120200 |
11 | 423002751394 |
12 | 1747347128b4 |
13 | 89241bb4923 |
14 | 42138d3c504 |
15 | 2134756a66a |
hex | 11771807788 |
1200200120200 has 24 divisors (see below), whose sum is σ = 2790465279930. Its totient is φ = 480080048000.
The previous prime is 1200200120191. The next prime is 1200200120213. The reversal of 1200200120200 is 20210020021.
It can be written as a sum of positive squares in 3 ways, for example, as 1068159456324 + 132040663876 = 1033518^2 + 363374^2 .
It is a super-3 number, since 3×12002001202003 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3000500101 + ... + 3000500500.
Almost surely, 21200200120200 is an apocalyptic number.
1200200120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200200120200 is an abundant number, since it is smaller than the sum of its proper divisors (1590265159730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200200120200 is a wasteful number, since it uses less digits than its factorization.
1200200120200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6001000617 (or 6001000608 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 1200200120200 its reverse (20210020021), we get a palindrome (1220410140221).
The spelling of 1200200120200 in words is "one trillion, two hundred billion, two hundred million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •