Base | Representation |
---|---|
bin | 101111100101110011… |
… | …1010010100100000111 |
3 | 100202210111221022000122 |
4 | 1133023213102210013 |
5 | 3133301240303221 |
6 | 114541123332155 |
7 | 10245422256233 |
oct | 1371347224407 |
9 | 322714838018 |
10 | 102200322311 |
11 | 3a38546589a |
12 | 1798282105b |
13 | 98396249c9 |
14 | 4d373835c3 |
15 | 29d24bbeab |
hex | 17cb9d2907 |
102200322311 has 4 divisors (see below), whose sum is σ = 102383806392. Its totient is φ = 102016838232.
The previous prime is 102200322299. The next prime is 102200322331. The reversal of 102200322311 is 113223002201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113223002201 = 19 ⋅5959105379.
It is a cyclic number.
It is not a de Polignac number, because 102200322311 - 218 = 102200060167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102200322311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200322331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91741205 + ... + 91742318.
It is an arithmetic number, because the mean of its divisors is an integer number (25595951598).
Almost surely, 2102200322311 is an apocalyptic number.
102200322311 is a deficient number, since it is larger than the sum of its proper divisors (183484081).
102200322311 is an equidigital number, since it uses as much as digits as its factorization.
102200322311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183484080.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102200322311 its reverse (113223002201), we get a palindrome (215423324512).
The spelling of 102200322311 in words is "one hundred two billion, two hundred million, three hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •