Base | Representation |
---|---|
bin | 11011010010011001111001… |
… | …110100111101011101101011 |
3 | 120201221001000000201221200120 |
4 | 123102121321310331131223 |
5 | 111212234104122024321 |
6 | 1103124432205334323 |
7 | 34164403510352154 |
oct | 3322317164753553 |
9 | 521831000657616 |
10 | 120012020111211 |
11 | 3526a8a2711718 |
12 | 115631728673a3 |
13 | 51c71147b3407 |
14 | 218c88160492b |
15 | dd1bc4a49ec6 |
hex | 6d2679d3d76b |
120012020111211 has 4 divisors (see below), whose sum is σ = 160016026814952. Its totient is φ = 80008013407472.
The previous prime is 120012020111173. The next prime is 120012020111231. The reversal of 120012020111211 is 112111020210021.
It is a happy number.
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 120012020111211 - 215 = 120012020078443 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120012020111231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20002003351866 + ... + 20002003351871.
It is an arithmetic number, because the mean of its divisors is an integer number (40004006703738).
Almost surely, 2120012020111211 is an apocalyptic number.
120012020111211 is a deficient number, since it is larger than the sum of its proper divisors (40004006703741).
120012020111211 is an equidigital number, since it uses as much as digits as its factorization.
120012020111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40004006703740.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 120012020111211 its reverse (112111020210021), we get a palindrome (232123040321232).
The spelling of 120012020111211 in words is "one hundred twenty trillion, twelve billion, twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •