Base | Representation |
---|---|
bin | 110000000011111001… |
… | …1101101001101011101 |
3 | 100212101220012220200121 |
4 | 1200013303231031131 |
5 | 3142333303211031 |
6 | 115225240554541 |
7 | 10312434211513 |
oct | 1400763551535 |
9 | 325356186617 |
10 | 103210210141 |
11 | 3a853522535 |
12 | 18004a82a51 |
13 | 996a91467c |
14 | 4dd15464b3 |
15 | 2a40ea3011 |
hex | 1807ced35d |
103210210141 has 4 divisors (see below), whose sum is σ = 103211153532. Its totient is φ = 103209266752.
The previous prime is 103210210139. The next prime is 103210210157. The reversal of 103210210141 is 141012012301.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 31146955225 + 72063254916 = 176485^2 + 268446^2 .
It is a cyclic number.
It is not a de Polignac number, because 103210210141 - 21 = 103210210139 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 (103210210171) 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, 282220 + ... + 534853.
It is an arithmetic number, because the mean of its divisors is an integer number (25802788383).
Almost surely, 2103210210141 is an apocalyptic number.
It is an amenable number.
103210210141 is a deficient number, since it is larger than the sum of its proper divisors (943391).
103210210141 is an equidigital number, since it uses as much as digits as its factorization.
103210210141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 943390.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 103210210141 its reverse (141012012301), we get a palindrome (244222222442).
The spelling of 103210210141 in words is "one hundred three billion, two hundred ten million, two hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •