Base | Representation |
---|---|
bin | 10000010100000111010… |
… | …111010101000001101001 |
3 | 10222011210002021220102210 |
4 | 100110013113111001221 |
5 | 121332013131121301 |
6 | 2215010354315333 |
7 | 143666102636643 |
oct | 20240727250151 |
9 | 3864702256383 |
10 | 1121110020201 |
11 | 3a2507419686 |
12 | 161341588b49 |
13 | 819494316a2 |
14 | 3c394d79893 |
15 | 1e268dd1ad6 |
hex | 105075d5069 |
1121110020201 has 4 divisors (see below), whose sum is σ = 1494813360272. Its totient is φ = 747406680132.
The previous prime is 1121110020187. The next prime is 1121110020221. The reversal of 1121110020201 is 1020200111211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1121110020201 - 221 = 1121107923049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121110020221) 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, 186851670031 + ... + 186851670036.
It is an arithmetic number, because the mean of its divisors is an integer number (373703340068).
Almost surely, 21121110020201 is an apocalyptic number.
It is an amenable number.
1121110020201 is a deficient number, since it is larger than the sum of its proper divisors (373703340071).
1121110020201 is an equidigital number, since it uses as much as digits as its factorization.
1121110020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373703340070.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1121110020201 its reverse (1020200111211), we get a palindrome (2141310131412).
The spelling of 1121110020201 in words is "one trillion, one hundred twenty-one billion, one hundred ten million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •