Base | Representation |
---|---|
bin | 110000000110101011… |
… | …1010001100011101101 |
3 | 100212122101121110202211 |
4 | 1200031113101203231 |
5 | 3143031133421031 |
6 | 115242410450421 |
7 | 10314645404005 |
oct | 1401527214355 |
9 | 325571543684 |
10 | 103303420141 |
11 | 3a8a10a6599 |
12 | 18030133a11 |
13 | 998401b70c |
14 | 4ddda8b005 |
15 | 2a49265bb1 |
hex | 180d5d18ed |
103303420141 has 12 divisors (see below), whose sum is σ = 109995147612. Its totient is φ = 96683072384.
The previous prime is 103303420069. The next prime is 103303420163. The reversal of 103303420141 is 141024303301.
It can be written as a sum of positive squares in 2 ways, for example, as 53319428100 + 49983992041 = 230910^2 + 223571^2 .
It is not a de Polignac number, because 103303420141 - 211 = 103303418093 is a prime.
It is a super-2 number, since 2×1033034201412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103303424141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 449871 + ... + 639523.
It is an arithmetic number, because the mean of its divisors is an integer number (9166262301).
Almost surely, 2103303420141 is an apocalyptic number.
It is an amenable number.
103303420141 is a deficient number, since it is larger than the sum of its proper divisors (6691727471).
103303420141 is an equidigital number, since it uses as much as digits as its factorization.
103303420141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190028 (or 189849 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 103303420141 its reverse (141024303301), we get a palindrome (244327723442).
The spelling of 103303420141 in words is "one hundred three billion, three hundred three million, four hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •