Base | Representation |
---|---|
bin | 10000000010011100001… |
… | …011111011110011110001 |
3 | 10220100210110210200201000 |
4 | 100002130023323303301 |
5 | 121024131243031113 |
6 | 2202151253432213 |
7 | 142424600305626 |
oct | 20023413736361 |
9 | 3810713720630 |
10 | 1102132002033 |
11 | 395458867747 |
12 | 15972593b669 |
13 | 7cc136bc43a |
14 | 3b4b46c434d |
15 | 1da07c3a373 |
hex | 1009c2fbcf1 |
1102132002033 has 8 divisors (see below), whose sum is σ = 1632788151200. Its totient is φ = 734754668004.
The previous prime is 1102132002007. The next prime is 1102132002047. The reversal of 1102132002033 is 3302002312011.
It is not a de Polignac number, because 1102132002033 - 25 = 1102132002001 is a prime.
It is a super-2 number, since 2×11021320020332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102132001997 and 1102132002015.
It is not an unprimeable number, because it can be changed into a prime (1102132002733) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20409851863 + ... + 20409851916.
It is an arithmetic number, because the mean of its divisors is an integer number (204098518900).
Almost surely, 21102132002033 is an apocalyptic number.
It is an amenable number.
1102132002033 is a deficient number, since it is larger than the sum of its proper divisors (530656149167).
1102132002033 is an equidigital number, since it uses as much as digits as its factorization.
1102132002033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40819703788 (or 40819703782 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1102132002033 its reverse (3302002312011), we get a palindrome (4404134314044).
The spelling of 1102132002033 in words is "one trillion, one hundred two billion, one hundred thirty-two million, two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •