Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …001000010110110111011 |
3 | 10220100110100201022220221 |
4 | 100002110121002312323 |
5 | 121023344303033201 |
6 | 2202130302400511 |
7 | 142421421553153 |
oct | 20022431026673 |
9 | 3810410638827 |
10 | 1102001221051 |
11 | 3953a0a61a95 |
12 | 1596a9b90137 |
13 | 7cbc258c343 |
14 | 3b4a119d763 |
15 | 1d9eb5054a1 |
hex | 10094642dbb |
1102001221051 has 2 divisors, whose sum is σ = 1102001221052. Its totient is φ = 1102001221050.
The previous prime is 1102001221049. The next prime is 1102001221099. The reversal of 1102001221051 is 1501221002011.
It is a weak prime.
It is an emirp because it is prime and its reverse (1501221002011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102001221051 - 21 = 1102001221049 is a prime.
Together with 1102001221049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1102001221151) 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 as a sum of consecutive naturals, namely, 551000610525 + 551000610526.
It is an arithmetic number, because the mean of its divisors is an integer number (551000610526).
Almost surely, 21102001221051 is an apocalyptic number.
1102001221051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102001221051 is an equidigital number, since it uses as much as digits as its factorization.
1102001221051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 1102001221051 its reverse (1501221002011), we get a palindrome (2603222223062).
The spelling of 1102001221051 in words is "one trillion, one hundred two billion, one million, two hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •