Base | Representation |
---|---|
bin | 101111100110011001… |
… | …1100101100111100111 |
3 | 100202211220120110020010 |
4 | 1133030303211213213 |
5 | 3133321400321203 |
6 | 114543120141303 |
7 | 10246054261200 |
oct | 1371463454747 |
9 | 322756513203 |
10 | 102220323303 |
11 | 3a39578693a |
12 | 17989467833 |
13 | 9840808707 |
14 | 4d39cac5a7 |
15 | 29d411d303 |
hex | 17ccce59e7 |
102220323303 has 48 divisors (see below), whose sum is σ = 163669752576. Its totient is φ = 56547912960.
The previous prime is 102220323301. The next prime is 102220323311. The reversal of 102220323303 is 303323022201.
It is not a de Polignac number, because 102220323303 - 21 = 102220323301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 102220323303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220323301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 642718 + ... + 785828.
It is an arithmetic number, because the mean of its divisors is an integer number (3409786512).
Almost surely, 2102220323303 is an apocalyptic number.
102220323303 is a deficient number, since it is larger than the sum of its proper divisors (61449429273).
102220323303 is a wasteful number, since it uses less digits than its factorization.
102220323303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143284 (or 143277 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 102220323303 its reverse (303323022201), we get a palindrome (405543345504).
The spelling of 102220323303 in words is "one hundred two billion, two hundred twenty million, three hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •