Base | Representation |
---|---|
bin | 10001011111101000101… |
… | …101111001000101101011 |
3 | 11020221002101210212102111 |
4 | 101133220231321011223 |
5 | 124144101224020021 |
6 | 2320141054543151 |
7 | 152566433156440 |
oct | 21375055710553 |
9 | 4227071725374 |
10 | 1202200220011 |
11 | 423939756a3a |
12 | 174bb2507ab7 |
13 | 894a039553b |
14 | 422888219c7 |
15 | 21412e4c8e1 |
hex | 117e8b7916b |
1202200220011 has 8 divisors (see below), whose sum is σ = 1383042070784. Its totient is φ = 1023633109800.
The previous prime is 1202200219999. The next prime is 1202200220027. The reversal of 1202200220011 is 1100220022021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1202200220011 - 211 = 1202200217963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1202200219973 and 1202200220000.
It is not an unprimeable number, because it can be changed into a prime (1202200221011) 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 7 ways as a sum of consecutive naturals, for example, 568684005 + ... + 568686118.
It is an arithmetic number, because the mean of its divisors is an integer number (172880258848).
Almost surely, 21202200220011 is an apocalyptic number.
1202200220011 is a deficient number, since it is larger than the sum of its proper divisors (180841850773).
1202200220011 is a wasteful number, since it uses less digits than its factorization.
1202200220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137370281.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1202200220011 its reverse (1100220022021), we get a palindrome (2302420242032).
The spelling of 1202200220011 in words is "one trillion, two hundred two billion, two hundred million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •