Base | Representation |
---|---|
bin | 101111111001110011… |
… | …1010000101001011101 |
3 | 100211112021200201210201 |
4 | 1133303213100221131 |
5 | 3141140034344401 |
6 | 115131455103501 |
7 | 10301151333055 |
oct | 1376347205135 |
9 | 324467621721 |
10 | 102871403101 |
11 | 3a69a252815 |
12 | 17b2b511b91 |
13 | 991567a02c |
14 | 4d9c550565 |
15 | 2a2137ab01 |
hex | 17f39d0a5d |
102871403101 has 4 divisors (see below), whose sum is σ = 102874856832. Its totient is φ = 102867949372.
The previous prime is 102871403099. The next prime is 102871403171. The reversal of 102871403101 is 101304178201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101304178201 = 23 ⋅4404529487.
It is a cyclic number.
It is not a de Polignac number, because 102871403101 - 21 = 102871403099 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 102871403101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102871403171) 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, 1681795 + ... + 1741888.
It is an arithmetic number, because the mean of its divisors is an integer number (25718714208).
Almost surely, 2102871403101 is an apocalyptic number.
It is an amenable number.
102871403101 is a deficient number, since it is larger than the sum of its proper divisors (3453731).
102871403101 is an equidigital number, since it uses as much as digits as its factorization.
102871403101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3453730.
The product of its (nonzero) digits is 1344, while the sum is 28.
The spelling of 102871403101 in words is "one hundred two billion, eight hundred seventy-one million, four hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •