Base | Representation |
---|---|
bin | 101111100110001010… |
… | …1111010101001110111 |
3 | 100202211100221021121010 |
4 | 1133030111322221313 |
5 | 3133312402421033 |
6 | 114542241323303 |
7 | 10245631204302 |
oct | 1371425725167 |
9 | 322740837533 |
10 | 102212545143 |
11 | 3a391354005 |
12 | 17986936533 |
13 | 983c014257 |
14 | 4d38c45b39 |
15 | 29d35d3863 |
hex | 17cc57aa77 |
102212545143 has 4 divisors (see below), whose sum is σ = 136283393528. Its totient is φ = 68141696760.
The previous prime is 102212545021. The next prime is 102212545147. The reversal of 102212545143 is 341545212201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 102212545143 - 221 = 102210447991 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 102212545143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212545147) 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 3 ways as a sum of consecutive naturals, for example, 17035424188 + ... + 17035424193.
It is an arithmetic number, because the mean of its divisors is an integer number (34070848382).
Almost surely, 2102212545143 is an apocalyptic number.
102212545143 is a deficient number, since it is larger than the sum of its proper divisors (34070848385).
102212545143 is an equidigital number, since it uses as much as digits as its factorization.
102212545143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34070848384.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 102212545143 its reverse (341545212201), we get a palindrome (443757757344).
The spelling of 102212545143 in words is "one hundred two billion, two hundred twelve million, five hundred forty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •