Base | Representation |
---|---|
bin | 10001011101101100110… |
… | …010101011101110010000 |
3 | 11020201201111120200121002 |
4 | 101131230302223232100 |
5 | 124130322000214300 |
6 | 2315154504121132 |
7 | 152464056021530 |
oct | 21355462535620 |
9 | 4221644520532 |
10 | 1200121101200 |
11 | 422a7209022a |
12 | 1747121661a8 |
13 | 8922b708c18 |
14 | 4212c64d4c0 |
15 | 2134065c5d5 |
hex | 1176ccabb90 |
1200121101200 has 60 divisors (see below), whose sum is σ = 3295189659840. Its totient is φ = 411470090880.
The previous prime is 1200121101197. The next prime is 1200121101203. The reversal of 1200121101200 is 21011210021.
It is an interprime number because it is at equal distance from previous prime (1200121101197) and next prime (1200121101203).
It is not an unprimeable number, because it can be changed into a prime (1200121101203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 214304540 + ... + 214310139.
It is an arithmetic number, because the mean of its divisors is an integer number (54919827664).
Almost surely, 21200121101200 is an apocalyptic number.
1200121101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200121101200 is an abundant number, since it is smaller than the sum of its proper divisors (2095068558640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200121101200 is a wasteful number, since it uses less digits than its factorization.
1200121101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428614704 (or 428614693 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1200121101200 its reverse (21011210021), we get a palindrome (1221132311221).
The spelling of 1200121101200 in words is "one trillion, two hundred billion, one hundred twenty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •