Base | Representation |
---|---|
bin | 11101000111000011100… |
… | …00111011000010100011 |
3 | 10112121202001121020000201 |
4 | 32203201300323002203 |
5 | 112341422322023021 |
6 | 2043254512130031 |
7 | 132156246444052 |
oct | 16434160730243 |
9 | 3477661536021 |
10 | 1000220111011 |
11 | 3562111a4620 |
12 | 141a23836917 |
13 | 73421a74944 |
14 | 365a7782399 |
15 | 1b040c44591 |
hex | e8e1c3b0a3 |
1000220111011 has 8 divisors (see below), whose sum is σ = 1091599570944. Its totient is φ = 908915710920.
The previous prime is 1000220110993. The next prime is 1000220111021. The reversal of 1000220111011 is 1101110220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000220111011 - 211 = 1000220108963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000220111021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18737091 + ... + 18790396.
It is an arithmetic number, because the mean of its divisors is an integer number (136449946368).
Almost surely, 21000220111011 is an apocalyptic number.
1000220111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000220111011 is a deficient number, since it is larger than the sum of its proper divisors (91379459933).
1000220111011 is a wasteful number, since it uses less digits than its factorization.
1000220111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37529921.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1000220111011 its reverse (1101110220001), we get a palindrome (2101330331012).
The spelling of 1000220111011 in words is "one trillion, two hundred twenty million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •