Base | Representation |
---|---|
bin | 111001110101100010… |
… | …0111000101111010111 |
3 | 102212120220212200201200 |
4 | 1303223010320233113 |
5 | 4013331432323111 |
6 | 133020313323543 |
7 | 11654603113611 |
oct | 1635304705727 |
9 | 385526780650 |
10 | 124203011031 |
11 | 487463a8560 |
12 | 200a34065b3 |
13 | b934ba8748 |
14 | 6023623db1 |
15 | 336de7c256 |
hex | 1ceb138bd7 |
124203011031 has 48 divisors (see below), whose sum is σ = 201097957632. Its totient is φ = 73218297600.
The previous prime is 124203011011. The next prime is 124203011057. The reversal of 124203011031 is 130110302421.
It is not a de Polignac number, because 124203011031 - 213 = 124203002839 is a prime.
It is a super-2 number, since 2×1242030110312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 124203010995 and 124203011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124203011011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 965406 + ... + 1086468.
It is an arithmetic number, because the mean of its divisors is an integer number (4189540784).
Almost surely, 2124203011031 is an apocalyptic number.
124203011031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
124203011031 is a deficient number, since it is larger than the sum of its proper divisors (76894946601).
124203011031 is a wasteful number, since it uses less digits than its factorization.
124203011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121364 (or 121361 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 124203011031 its reverse (130110302421), we get a palindrome (254313313452).
The spelling of 124203011031 in words is "one hundred twenty-four billion, two hundred three million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •