Base | Representation |
---|---|
bin | 1110110010010… |
… | …00111001000011 |
3 | 22122101101220101 |
4 | 13121020321003 |
5 | 223222434111 |
6 | 20150223231 |
7 | 3034146022 |
oct | 731107103 |
9 | 278341811 |
10 | 124030531 |
11 | 64014a79 |
12 | 35654b17 |
13 | 1c908661 |
14 | 126888b9 |
15 | ad4ebc1 |
hex | 7648e43 |
124030531 has 4 divisors (see below), whose sum is σ = 124654000. Its totient is φ = 123407064.
The previous prime is 124030523. The next prime is 124030561. The reversal of 124030531 is 135030421.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 124030531 - 23 = 124030523 is a prime.
It is a super-2 number, since 2×1240305312 = 30767145240283922, 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 = 124030499 and 124030508.
It is not an unprimeable number, because it can be changed into a prime (124030561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 311436 + ... + 311833.
It is an arithmetic number, because the mean of its divisors is an integer number (31163500).
Almost surely, 2124030531 is an apocalyptic number.
124030531 is a deficient number, since it is larger than the sum of its proper divisors (623469).
124030531 is an equidigital number, since it uses as much as digits as its factorization.
124030531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623468.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 124030531 is about 11136.8995236556. The cubic root of 124030531 is about 498.7040184325.
Adding to 124030531 its reverse (135030421), we get a palindrome (259060952).
The spelling of 124030531 in words is "one hundred twenty-four million, thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •