Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …100110111000000111001 |
3 | 10220100110102121010202021 |
4 | 100002110130313000321 |
5 | 121023400032033423 |
6 | 2202130340034441 |
7 | 142421433216613 |
oct | 20022434670071 |
9 | 3810412533667 |
10 | 1102002221113 |
11 | 3953a1585392 |
12 | 1596aa392a21 |
13 | 7cbc284c5b1 |
14 | 3b4a137ddb3 |
15 | 1d9eb65195d |
hex | 10094737039 |
1102002221113 has 2 divisors, whose sum is σ = 1102002221114. Its totient is φ = 1102002221112.
The previous prime is 1102002221077. The next prime is 1102002221123. The reversal of 1102002221113 is 3111222002011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 734915281984 + 367086939129 = 857272^2 + 605877^2 .
It is an emirp because it is prime and its reverse (3111222002011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102002221113 - 213 = 1102002212921 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102002221123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551001110556 + 551001110557.
It is an arithmetic number, because the mean of its divisors is an integer number (551001110557).
Almost surely, 21102002221113 is an apocalyptic number.
It is an amenable number.
1102002221113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102002221113 is an equidigital number, since it uses as much as digits as its factorization.
1102002221113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1102002221113 its reverse (3111222002011), we get a palindrome (4213224223124).
The spelling of 1102002221113 in words is "one trillion, one hundred two billion, two million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.852 sec. • engine limits •