Base | Representation |
---|---|
bin | 101111111110100110… |
… | …1011111011100101111 |
3 | 100211221111200020122212 |
4 | 1133331031133130233 |
5 | 3142002244421033 |
6 | 115155450201035 |
7 | 10305145056362 |
oct | 1377515373457 |
9 | 324844606585 |
10 | 103032420143 |
11 | 3a77212a254 |
12 | 17b7542317b |
13 | 993cb356a3 |
14 | 4db5aa60d9 |
15 | 2a30584748 |
hex | 17fd35f72f |
103032420143 has 4 divisors (see below), whose sum is σ = 107512090608. Its totient is φ = 98552749680.
The previous prime is 103032420133. The next prime is 103032420223. The reversal of 103032420143 is 341024230301.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 103032420143 - 28 = 103032419887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 4479670441 = 103032420143 / (1 + 0 + 3 + 0 + 3 + 2 + 4 + 2 + 0 + 1 + 4 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032420103) 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, 2239835198 + ... + 2239835243.
It is an arithmetic number, because the mean of its divisors is an integer number (26878022652).
Almost surely, 2103032420143 is an apocalyptic number.
103032420143 is a deficient number, since it is larger than the sum of its proper divisors (4479670465).
103032420143 is an equidigital number, since it uses as much as digits as its factorization.
103032420143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4479670464.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 103032420143 its reverse (341024230301), we get a palindrome (444056650444).
The spelling of 103032420143 in words is "one hundred three billion, thirty-two million, four hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •