Base | Representation |
---|---|
bin | 11011010010100001100001… |
… | …011000110001001010100011 |
3 | 120201221211010002122110122111 |
4 | 123102201201120301022203 |
5 | 111212402332200032321 |
6 | 1103132304013020151 |
7 | 34165113304314655 |
oct | 3322414130611243 |
9 | 521854102573574 |
10 | 120020200002211 |
11 | 3527330aa87913 |
12 | 11564876184657 |
13 | 51c7b1938c8c2 |
14 | 218d019b386d5 |
15 | dd2002c2b5e1 |
hex | 6d28616312a3 |
120020200002211 has 4 divisors (see below), whose sum is σ = 120020809943152. Its totient is φ = 120019590061272.
The previous prime is 120020200002187. The next prime is 120020200002341. The reversal of 120020200002211 is 112200002020021.
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 120020200002211 - 217 = 120020199871139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120020200002191 and 120020200002200.
It is not an unprimeable number, because it can be changed into a prime (120020200008211) 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, 304675215 + ... + 305068888.
It is an arithmetic number, because the mean of its divisors is an integer number (30005202485788).
Almost surely, 2120020200002211 is an apocalyptic number.
120020200002211 is a deficient number, since it is larger than the sum of its proper divisors (609940941).
120020200002211 is an equidigital number, since it uses as much as digits as its factorization.
120020200002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 609940940.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 120020200002211 its reverse (112200002020021), we get a palindrome (232220202022232).
The spelling of 120020200002211 in words is "one hundred twenty trillion, twenty billion, two hundred million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •