Base | Representation |
---|---|
bin | 11011010101011011100111… |
… | …100110000001101010010011 |
3 | 120202122220212220110012102121 |
4 | 123111123213212001222103 |
5 | 111224141100122321321 |
6 | 1103404151555355111 |
7 | 34215416112304444 |
oct | 3325334746015223 |
9 | 522586786405377 |
10 | 120220020120211 |
11 | 3534002a257000 |
12 | 115975415b2a97 |
13 | 521091234980b |
14 | 2198973d932cb |
15 | dd72ea4bc441 |
hex | 6d56e7981a93 |
120220020120211 has 16 divisors (see below), whose sum is σ = 132233872837248. Its totient is φ = 109290197571720.
The previous prime is 120220020120203. The next prime is 120220020120251. The reversal of 120220020120211 is 112021020022021.
It is a happy number.
It is not a de Polignac number, because 120220020120211 - 23 = 120220020120203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120220020120251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 367974016 + ... + 368300578.
It is an arithmetic number, because the mean of its divisors is an integer number (8264617052328).
Almost surely, 2120220020120211 is an apocalyptic number.
120220020120211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120220020120211 is a deficient number, since it is larger than the sum of its proper divisors (12013852717037).
120220020120211 is an equidigital number, since it uses as much as digits as its factorization.
120220020120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603183 (or 603161 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120220020120211 its reverse (112021020022021), we get a palindrome (232241040142232).
The spelling of 120220020120211 in words is "one hundred twenty trillion, two hundred twenty billion, twenty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •