Base | Representation |
---|---|
bin | 11101000111000011100… |
… | …00100100110100010111 |
3 | 10112121202001102121011121 |
4 | 32203201300210310113 |
5 | 112341422311114431 |
6 | 2043254510144411 |
7 | 132156245614513 |
oct | 16434160446427 |
9 | 3477661377147 |
10 | 1000220019991 |
11 | 3562111421a5 |
12 | 141a237b2107 |
13 | 73421a4239a |
14 | 365a775b143 |
15 | 1b040c27611 |
hex | e8e1c24d17 |
1000220019991 has 2 divisors, whose sum is σ = 1000220019992. Its totient is φ = 1000220019990.
The previous prime is 1000220019989. The next prime is 1000220020013. The reversal of 1000220019991 is 1999100220001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000220019991 - 21 = 1000220019989 is a prime.
Together with 1000220019989, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000220019941) 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 as a sum of consecutive naturals, namely, 500110009995 + 500110009996.
It is an arithmetic number, because the mean of its divisors is an integer number (500110009996).
Almost surely, 21000220019991 is an apocalyptic number.
1000220019991 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000220019991 is an equidigital number, since it uses as much as digits as its factorization.
1000220019991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 34.
Adding to 1000220019991 its reverse (1999100220001), we get a palindrome (2999320239992).
The spelling of 1000220019991 in words is "one trillion, two hundred twenty million, nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •