Base | Representation |
---|---|
bin | 101111100101110011… |
… | …1010010000000100001 |
3 | 100202210111221011220021 |
4 | 1133023213102000201 |
5 | 3133301240220113 |
6 | 114541123313441 |
7 | 10245422246500 |
oct | 1371347220041 |
9 | 322714834807 |
10 | 102200320033 |
11 | 3a385464109 |
12 | 1798281b881 |
13 | 9839623966 |
14 | 4d37382837 |
15 | 29d24bb48d |
hex | 17cb9d2021 |
102200320033 has 12 divisors (see below), whose sum is σ = 118902721392. Its totient is φ = 87588017160.
The previous prime is 102200319943. The next prime is 102200320049. The reversal of 102200320033 is 330023002201.
It is not a de Polignac number, because 102200320033 - 233 = 93610385441 is a prime.
It is a super-2 number, since 2×1022003200332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102200319989 and 102200320016.
It is not an unprimeable number, because it can be changed into a prime (102200320073) 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 in 11 ways as a sum of consecutive naturals, for example, 216966 + ... + 501472.
It is an arithmetic number, because the mean of its divisors is an integer number (9908560116).
Almost surely, 2102200320033 is an apocalyptic number.
It is an amenable number.
102200320033 is a deficient number, since it is larger than the sum of its proper divisors (16702401359).
102200320033 is an equidigital number, since it uses as much as digits as its factorization.
102200320033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291852 (or 291845 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 102200320033 its reverse (330023002201), we get a palindrome (432223322234).
The spelling of 102200320033 in words is "one hundred two billion, two hundred million, three hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •