Base | Representation |
---|---|
bin | 1110110100100… |
… | …10010000111001 |
3 | 22122221200011021 |
4 | 13122102100321 |
5 | 223312043230 |
6 | 20200502441 |
7 | 3036540145 |
oct | 732222071 |
9 | 278850137 |
10 | 124331065 |
11 | 641aa851 |
12 | 3577aa21 |
13 | 1c9b23a1 |
14 | 12726225 |
15 | adadc7a |
hex | 7692439 |
124331065 has 8 divisors (see below), whose sum is σ = 152836488. Its totient is φ = 97038720.
The previous prime is 124331059. The next prime is 124331071. The reversal of 124331065 is 560133421.
It is an interprime number because it is at equal distance from previous prime (124331059) and next prime (124331071).
It can be written as a sum of positive squares in 4 ways, for example, as 1498176 + 122832889 = 1224^2 + 11083^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 124331065 - 27 = 124330937 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 303042 + ... + 303451.
It is an arithmetic number, because the mean of its divisors is an integer number (19104561).
Almost surely, 2124331065 is an apocalyptic number.
It is an amenable number.
124331065 is a deficient number, since it is larger than the sum of its proper divisors (28505423).
124331065 is an equidigital number, since it uses as much as digits as its factorization.
124331065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606539.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 124331065 is about 11150.3840741026. The cubic root of 124331065 is about 499.1064909008.
Adding to 124331065 its reverse (560133421), we get a palindrome (684464486).
The spelling of 124331065 in words is "one hundred twenty-four million, three hundred thirty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •