Base | Representation |
---|---|
bin | 111001110101100010… |
… | …0111000100000110111 |
3 | 102212120220212122110022 |
4 | 1303223010320200313 |
5 | 4013331432310403 |
6 | 133020313315355 |
7 | 11654603111114 |
oct | 1635304704067 |
9 | 385526778408 |
10 | 124203010103 |
11 | 487463a7897 |
12 | 200a3405b5b |
13 | b934ba81b3 |
14 | 602362390b |
15 | 336de7bd38 |
hex | 1ceb138837 |
124203010103 has 4 divisors (see below), whose sum is σ = 128209558848. Its totient is φ = 120196461360.
The previous prime is 124203010037. The next prime is 124203010121. The reversal of 124203010103 is 301010302421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301010302421 = 211 ⋅1426589111.
It is a cyclic number.
It is not a de Polignac number, because 124203010103 - 210 = 124203009079 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 (124203010153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2003274326 + ... + 2003274387.
It is an arithmetic number, because the mean of its divisors is an integer number (32052389712).
Almost surely, 2124203010103 is an apocalyptic number.
124203010103 is a deficient number, since it is larger than the sum of its proper divisors (4006548745).
124203010103 is an equidigital number, since it uses as much as digits as its factorization.
124203010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4006548744.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 124203010103 its reverse (301010302421), we get a palindrome (425213312524).
The spelling of 124203010103 in words is "one hundred twenty-four billion, two hundred three million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •