Base | Representation |
---|---|
bin | 110000000001010110… |
… | …0011101100110110111 |
3 | 100212011220210120210110 |
4 | 1200002230131212313 |
5 | 3142144323101033 |
6 | 115212534154103 |
7 | 10310343102465 |
oct | 1400254354667 |
9 | 325156716713 |
10 | 103124425143 |
11 | 3a80a05aa43 |
12 | 17ba01b2933 |
13 | 9955c0a10c |
14 | 4dc3db5835 |
15 | 2a386aa363 |
hex | 1802b1d9b7 |
103124425143 has 4 divisors (see below), whose sum is σ = 137499233528. Its totient is φ = 68749616760.
The previous prime is 103124425141. The next prime is 103124425171. The reversal of 103124425143 is 341524421301.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 103124425143 - 21 = 103124425141 is a prime.
It is a super-2 number, since 2×1031244251432 (a number of 23 digits) contains 22 as substring.
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 103124425143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103124425141) 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, 17187404188 + ... + 17187404193.
It is an arithmetic number, because the mean of its divisors is an integer number (34374808382).
Almost surely, 2103124425143 is an apocalyptic number.
103124425143 is a deficient number, since it is larger than the sum of its proper divisors (34374808385).
103124425143 is an equidigital number, since it uses as much as digits as its factorization.
103124425143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34374808384.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 103124425143 its reverse (341524421301), we get a palindrome (444648846444).
The spelling of 103124425143 in words is "one hundred three billion, one hundred twenty-four million, four hundred twenty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •