Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …001101100001010010011 |
3 | 10222001222010110020201111 |
4 | 100103012121230022103 |
5 | 121322300122321321 |
6 | 2214310302114151 |
7 | 143630066640646 |
oct | 20230631541223 |
9 | 3861863406644 |
10 | 1120020120211 |
11 | 3a1aa8182693 |
12 | 16109857b957 |
13 | 818046a8c55 |
14 | 3c2d0309a5d |
15 | 1e2033935e1 |
hex | 104c666c293 |
1120020120211 has 4 divisors (see below), whose sum is σ = 1185903656712. Its totient is φ = 1054136583712.
The previous prime is 1120020120209. The next prime is 1120020120227. The reversal of 1120020120211 is 1120210200211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1120020120211 - 21 = 1120020120209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120020120191 and 1120020120200.
It is not an unprimeable number, because it can be changed into a prime (1120020120511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32941768225 + ... + 32941768258.
It is an arithmetic number, because the mean of its divisors is an integer number (296475914178).
Almost surely, 21120020120211 is an apocalyptic number.
1120020120211 is a deficient number, since it is larger than the sum of its proper divisors (65883536501).
1120020120211 is an equidigital number, since it uses as much as digits as its factorization.
1120020120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65883536500.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1120020120211 its reverse (1120210200211), we get a palindrome (2240230320422).
The spelling of 1120020120211 in words is "one trillion, one hundred twenty billion, twenty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •