Base | Representation |
---|---|
bin | 10000000010100111111… |
… | …111101111101001110111 |
3 | 10220101022021121210110002 |
4 | 100002213333233221313 |
5 | 121030033003224421 |
6 | 2202223052221515 |
7 | 142432524350354 |
oct | 20024777575167 |
9 | 3811267553402 |
10 | 1102330133111 |
11 | 39554a693539 |
12 | 15978016a89b |
13 | 7cc45770b6c |
14 | 3b4d2b3b62b |
15 | 1da1a325b0b |
hex | 100a7fefa77 |
1102330133111 has 2 divisors, whose sum is σ = 1102330133112. Its totient is φ = 1102330133110.
The previous prime is 1102330133101. The next prime is 1102330133167. The reversal of 1102330133111 is 1113310332011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102330133111 is a prime.
It is a super-3 number, since 3×11023301331113 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102330133101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551165066555 + 551165066556.
It is an arithmetic number, because the mean of its divisors is an integer number (551165066556).
Almost surely, 21102330133111 is an apocalyptic number.
1102330133111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102330133111 is an equidigital number, since it uses as much as digits as its factorization.
1102330133111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1102330133111 its reverse (1113310332011), we get a palindrome (2215640465122).
The spelling of 1102330133111 in words is "one trillion, one hundred two billion, three hundred thirty million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •