Base | Representation |
---|---|
bin | 10001011101100110001… |
… | …011101000010010010011 |
3 | 11020201102202220100001001 |
4 | 101131212023220102103 |
5 | 124130110102401321 |
6 | 2315135503122431 |
7 | 152461241255164 |
oct | 21354613502223 |
9 | 4221382810031 |
10 | 1200010200211 |
11 | 422a15523719 |
12 | 1746a0ba3417 |
13 | 89211749734 |
14 | 4211ba2176b |
15 | 21335a52c91 |
hex | 117662e8493 |
1200010200211 has 8 divisors (see below), whose sum is σ = 1212281607600. Its totient is φ = 1187746442400.
The previous prime is 1200010200203. The next prime is 1200010200227. The reversal of 1200010200211 is 1120020100021.
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 1200010200211 - 23 = 1200010200203 is a prime.
It is a super-2 number, since 2×12000102002112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200010200241) 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, 1596781 + ... + 2224798.
It is an arithmetic number, because the mean of its divisors is an integer number (151535200950).
Almost surely, 21200010200211 is an apocalyptic number.
1200010200211 is a deficient number, since it is larger than the sum of its proper divisors (12271407389).
1200010200211 is a wasteful number, since it uses less digits than its factorization.
1200010200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3824789.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1200010200211 its reverse (1120020100021), we get a palindrome (2320030300232).
The spelling of 1200010200211 in words is "one trillion, two hundred billion, ten million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •