Base | Representation |
---|---|
bin | 1110110010011… |
… | …01101001101111 |
3 | 22122102101122121 |
4 | 13121031221233 |
5 | 223224100111 |
6 | 20150453411 |
7 | 3034256620 |
oct | 731155157 |
9 | 278371577 |
10 | 124050031 |
11 | 64028696 |
12 | 35664267 |
13 | 1c9144b1 |
14 | 12691a47 |
15 | ad55871 |
hex | 764da6f |
124050031 has 16 divisors (see below), whose sum is σ = 151471360. Its totient is φ = 99221760.
The previous prime is 124050013. The next prime is 124050049. The reversal of 124050031 is 130050421.
It is an interprime number because it is at equal distance from previous prime (124050013) and next prime (124050049).
It is a cyclic number.
It is not a de Polignac number, because 124050031 - 211 = 124047983 is a prime.
It is a super-2 number, since 2×1240500312 = 30776820382201922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124049987 and 124050014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124050131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1951 + ... + 15871.
It is an arithmetic number, because the mean of its divisors is an integer number (9466960).
Almost surely, 2124050031 is an apocalyptic number.
124050031 is a deficient number, since it is larger than the sum of its proper divisors (27421329).
124050031 is a wasteful number, since it uses less digits than its factorization.
124050031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14014.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 124050031 is about 11137.7749573243. The cubic root of 124050031 is about 498.7301523709.
The spelling of 124050031 in words is "one hundred twenty-four million, fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •