Base | Representation |
---|---|
bin | 11011010101010100001001… |
… | …100011101110111111100011 |
3 | 120202122011011222012101210111 |
4 | 123111110021203232333203 |
5 | 111224023134000311321 |
6 | 1103400344100512151 |
7 | 34215013265426524 |
oct | 3325241143567743 |
9 | 522564158171714 |
10 | 120212000010211 |
11 | 353376940a371a |
12 | 11595a836ab657 |
13 | 520cc348b51b5 |
14 | 2198412b7284b |
15 | dd6ecb34d5e1 |
hex | 6d55098eefe3 |
120212000010211 has 4 divisors (see below), whose sum is σ = 120212128972000. Its totient is φ = 120211871048424.
The previous prime is 120212000010203. The next prime is 120212000010229. The reversal of 120212000010211 is 112010000212021.
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 120212000010211 - 23 = 120212000010203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120212000010191 and 120212000010200.
It is not an unprimeable number, because it can be changed into a prime (120212000010251) 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, 63072411 + ... + 64950388.
It is an arithmetic number, because the mean of its divisors is an integer number (30053032243000).
Almost surely, 2120212000010211 is an apocalyptic number.
120212000010211 is a deficient number, since it is larger than the sum of its proper divisors (128961789).
120212000010211 is an equidigital number, since it uses as much as digits as its factorization.
120212000010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128961788.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120212000010211 its reverse (112010000212021), we get a palindrome (232222000222232).
The spelling of 120212000010211 in words is "one hundred twenty trillion, two hundred twelve billion, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •