Base | Representation |
---|---|
bin | 10001011101110010101… |
… | …100011000010010001011 |
3 | 11020201222101212221220011 |
4 | 101131302230120102023 |
5 | 124131022322041021 |
6 | 2315212402212351 |
7 | 152466400424014 |
oct | 21356254302213 |
9 | 4221871787804 |
10 | 1200220112011 |
11 | 423012a66548 |
12 | 17473b3540b7 |
13 | 892460943bb |
14 | 4213b86400b |
15 | 213491b8de1 |
hex | 11772b1848b |
1200220112011 has 8 divisors (see below), whose sum is σ = 1203281077824. Its totient is φ = 1197159484800.
The previous prime is 1200220111957. The next prime is 1200220112027. The reversal of 1200220112011 is 1102110220021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1200220112011 - 215 = 1200220079243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200220111982 and 1200220112000.
It is not an unprimeable number, because it can be changed into a prime (1200220112911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7992526 + ... + 8141308.
It is an arithmetic number, because the mean of its divisors is an integer number (150410134728).
Almost surely, 21200220112011 is an apocalyptic number.
1200220112011 is a deficient number, since it is larger than the sum of its proper divisors (3060965813).
1200220112011 is a wasteful number, since it uses less digits than its factorization.
1200220112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169301.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1200220112011 its reverse (1102110220021), we get a palindrome (2302330332032).
The spelling of 1200220112011 in words is "one trillion, two hundred billion, two hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •