Base | Representation |
---|---|
bin | 11011100011101100011111… |
… | …100001011111111101110000 |
3 | 120220010121221002112010011011 |
4 | 123203230133201133331300 |
5 | 111341221013004014300 |
6 | 1105434335220000304 |
7 | 34346266133314102 |
oct | 3343543741377560 |
9 | 526117832463134 |
10 | 121200211001200 |
11 | 356887a2477661 |
12 | 117154b5530094 |
13 | 5282191651156 |
14 | 21d019b601572 |
15 | e02a67b1eeba |
hex | 6e3b1f85ff70 |
121200211001200 has 60 divisors (see below), whose sum is σ = 291571235358688. Its totient is φ = 48415530240000.
The previous prime is 121200211001183. The next prime is 121200211001213. The reversal of 121200211001200 is 2100112002121.
It is a super-2 number, since 2×1212002110012002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 201430977 + ... + 202031776.
Almost surely, 2121200211001200 is an apocalyptic number.
121200211001200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121200211001200 is an abundant number, since it is smaller than the sum of its proper divisors (170371024357488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121200211001200 is a wasteful number, since it uses less digits than its factorization.
121200211001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403463522 (or 403463511 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121200211001200 its reverse (2100112002121), we get a palindrome (123300323003321).
The spelling of 121200211001200 in words is "one hundred twenty-one trillion, two hundred billion, two hundred eleven million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •