Base | Representation |
---|---|
bin | 10111001111011001011110… |
… | …101010111110001100010111 |
3 | 111101220111012001021100011021 |
4 | 113033121132222332030113 |
5 | 101344130133312031203 |
6 | 1001220034405022011 |
7 | 30346442610054421 |
oct | 2717313652761427 |
9 | 441814161240137 |
10 | 102213220033303 |
11 | 2a628424019915 |
12 | b5697346b4907 |
13 | 450588584aaa2 |
14 | 1b35209427811 |
15 | bc3c016385bd |
hex | 5cf65eabe317 |
102213220033303 has 16 divisors (see below), whose sum is σ = 104871660926976. Its totient is φ = 99586695932640.
The previous prime is 102213220033291. The next prime is 102213220033313. The reversal of 102213220033303 is 303330022312201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102213220033303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102213220033313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56965350 + ... + 58732252.
It is an arithmetic number, because the mean of its divisors is an integer number (6554478807936).
Almost surely, 2102213220033303 is an apocalyptic number.
102213220033303 is a deficient number, since it is larger than the sum of its proper divisors (2658440893673).
102213220033303 is a wasteful number, since it uses less digits than its factorization.
102213220033303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1775934.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 102213220033303 its reverse (303330022312201), we get a palindrome (405543242345504).
The spelling of 102213220033303 in words is "one hundred two trillion, two hundred thirteen billion, two hundred twenty million, thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •