Base | Representation |
---|---|
bin | 10000000010100111100… |
… | …001001110100101001011 |
3 | 10220101021201120100210122 |
4 | 100002213201032211023 |
5 | 121030023431231243 |
6 | 2202222204533455 |
7 | 142432366351355 |
oct | 20024741164513 |
9 | 3811251510718 |
10 | 1102322133323 |
11 | 39554611a144 |
12 | 15977955128b |
13 | 7cc43bcc868 |
14 | 3b4d1a580d5 |
15 | 1da19795668 |
hex | 100a784e94b |
1102322133323 has 2 divisors, whose sum is σ = 1102322133324. Its totient is φ = 1102322133322.
The previous prime is 1102322133313. The next prime is 1102322133329. The reversal of 1102322133323 is 3233312232011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102322133323 - 216 = 1102322067787 is a prime.
It is a super-2 number, since 2×11023221333232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102322133292 and 1102322133301.
It is not a weakly prime, because it can be changed into another prime (1102322133329) 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, 551161066661 + 551161066662.
It is an arithmetic number, because the mean of its divisors is an integer number (551161066662).
Almost surely, 21102322133323 is an apocalyptic number.
1102322133323 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102322133323 is an equidigital number, since it uses as much as digits as its factorization.
1102322133323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 1102322133323 its reverse (3233312232011), we get a palindrome (4335634365334).
The spelling of 1102322133323 in words is "one trillion, one hundred two billion, three hundred twenty-two million, one hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •