Base | Representation |
---|---|
bin | 1110110011110… |
… | …10100101111001 |
3 | 22122202202011011 |
4 | 13121322211321 |
5 | 223300442410 |
6 | 20154433521 |
7 | 3035654362 |
oct | 731724571 |
9 | 278682134 |
10 | 124234105 |
11 | 64143a16 |
12 | 357328a1 |
13 | 1c97a208 |
14 | 126dcb69 |
15 | ad9018a |
hex | 767a979 |
124234105 has 8 divisors (see below), whose sum is σ = 149142600. Its totient is φ = 99346176.
The previous prime is 124234087. The next prime is 124234111. The reversal of 124234105 is 501432421.
It can be written as a sum of positive squares in 4 ways, for example, as 646416 + 123587689 = 804^2 + 11117^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 124234105 - 25 = 124234073 is a prime.
It is a super-2 number, since 2×1242341052 = 30868225690302050, which contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 16251 + ... + 22639.
It is an arithmetic number, because the mean of its divisors is an integer number (18642825).
Almost surely, 2124234105 is an apocalyptic number.
It is an amenable number.
124234105 is a deficient number, since it is larger than the sum of its proper divisors (24908495).
124234105 is an equidigital number, since it uses as much as digits as its factorization.
124234105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10283.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 124234105 is about 11146.0353938071. The cubic root of 124234105 is about 498.9767138663.
Adding to 124234105 its reverse (501432421), we get a palindrome (625666526).
The spelling of 124234105 in words is "one hundred twenty-four million, two hundred thirty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •