Base | Representation |
---|---|
bin | 10001011101110010110… |
… | …000001001111110111011 |
3 | 11020201222110202020220211 |
4 | 101131302300021332323 |
5 | 124131023100231021 |
6 | 2315212435331551 |
7 | 152466412016221 |
oct | 21356260117673 |
9 | 4221873666824 |
10 | 1200221102011 |
11 | 423013582328 |
12 | 17473b750bb7 |
13 | 8924634cbb9 |
14 | 4213ba40b11 |
15 | 213493123e1 |
hex | 11772c09fbb |
1200221102011 has 4 divisors (see below), whose sum is σ = 1201210568272. Its totient is φ = 1199231635752.
The previous prime is 1200221101999. The next prime is 1200221102029. The reversal of 1200221102011 is 1102011220021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1200221102011 - 219 = 1200220577723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200221101982 and 1200221102000.
It is not an unprimeable number, because it can be changed into a prime (1200221102411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 494731311 + ... + 494733736.
It is an arithmetic number, because the mean of its divisors is an integer number (300302642068).
Almost surely, 21200221102011 is an apocalyptic number.
1200221102011 is a deficient number, since it is larger than the sum of its proper divisors (989466261).
1200221102011 is an equidigital number, since it uses as much as digits as its factorization.
1200221102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 989466260.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1200221102011 its reverse (1102011220021), we get a palindrome (2302232322032).
The spelling of 1200221102011 in words is "one trillion, two hundred billion, two hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •