Base | Representation |
---|---|
bin | 1110110010000… |
… | …10110101010001 |
3 | 22122100010212012 |
4 | 13121002311101 |
5 | 223221140323 |
6 | 20145512305 |
7 | 3034013456 |
oct | 731026521 |
9 | 278303765 |
10 | 124005713 |
11 | 63aa8367 |
12 | 35642695 |
13 | 1c8ca280 |
14 | 1267d82d |
15 | ad47678 |
hex | 7642d51 |
124005713 has 8 divisors (see below), whose sum is σ = 133634088. Its totient is φ = 114390144.
The previous prime is 124005709. The next prime is 124005727. The reversal of 124005713 is 317500421.
It can be written as a sum of positive squares in 4 ways, for example, as 13082689 + 110923024 = 3617^2 + 10532^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 124005713 - 22 = 124005709 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124005113) 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 7 ways as a sum of consecutive naturals, for example, 28895 + ... + 32907.
It is an arithmetic number, because the mean of its divisors is an integer number (16704261).
Almost surely, 2124005713 is an apocalyptic number.
124005713 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
124005713 is a deficient number, since it is larger than the sum of its proper divisors (9628375).
124005713 is a wasteful number, since it uses less digits than its factorization.
124005713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6403.
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 124005713 is about 11135.7852439781. The cubic root of 124005713 is about 498.6707533381.
The spelling of 124005713 in words is "one hundred twenty-four million, five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •