Base | Representation |
---|---|
bin | 11011010010100011011000… |
… | …101101110100110110000011 |
3 | 120201222000021121210001102120 |
4 | 123102203120231310312003 |
5 | 111212420432203323021 |
6 | 1103133234411015323 |
7 | 34165214024154216 |
oct | 3322433055646603 |
9 | 521860247701376 |
10 | 120022202011011 |
11 | 35274148076743 |
12 | 1156513473a543 |
13 | 51c807808b3b1 |
14 | 218d16999777d |
15 | dd20bd8892c6 |
hex | 6d28d8b74d83 |
120022202011011 has 4 divisors (see below), whose sum is σ = 160029602681352. Its totient is φ = 80014801340672.
The previous prime is 120022202010989. The next prime is 120022202011027. The reversal of 120022202011011 is 110110202220021.
120022202011011 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
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 120022202011011 - 210 = 120022202009987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120022202011081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20003700335166 + ... + 20003700335171.
It is an arithmetic number, because the mean of its divisors is an integer number (40007400670338).
Almost surely, 2120022202011011 is an apocalyptic number.
120022202011011 is a deficient number, since it is larger than the sum of its proper divisors (40007400670341).
120022202011011 is an equidigital number, since it uses as much as digits as its factorization.
120022202011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40007400670340.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120022202011011 its reverse (110110202220021), we get a palindrome (230132404231032).
The spelling of 120022202011011 in words is "one hundred twenty trillion, twenty-two billion, two hundred two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •