Base | Representation |
---|---|
bin | 111001110011101111… |
… | …1000010000101110101 |
3 | 102212102201111102122202 |
4 | 1303213133002011311 |
5 | 4013221021144323 |
6 | 133010322034245 |
7 | 11653242005600 |
oct | 1634737020565 |
9 | 385381442582 |
10 | 124142756213 |
11 | 48715393193 |
12 | 200871a8985 |
13 | b92556c7c8 |
14 | 601961b337 |
15 | 3368a28d28 |
hex | 1ce77c2175 |
124142756213 has 24 divisors (see below), whose sum is σ = 150930927000. Its totient is φ = 101679556608.
The previous prime is 124142756191. The next prime is 124142756219. The reversal of 124142756213 is 312657241421.
It can be written as a sum of positive squares in 4 ways, for example, as 10804147249 + 113338608964 = 103943^2 + 336658^2 .
It is not a de Polignac number, because 124142756213 - 214 = 124142739829 is a prime.
It is a super-2 number, since 2×1241427562132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124142756219) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 312488 + ... + 588161.
It is an arithmetic number, because the mean of its divisors is an integer number (6288788625).
Almost surely, 2124142756213 is an apocalyptic number.
It is an amenable number.
124142756213 is a deficient number, since it is larger than the sum of its proper divisors (26788170787).
124142756213 is an equidigital number, since it uses as much as digits as its factorization.
124142756213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 900789 (or 900782 counting only the distinct ones).
The product of its digits is 80640, while the sum is 38.
Adding to 124142756213 its reverse (312657241421), we get a palindrome (436799997634).
The spelling of 124142756213 in words is "one hundred twenty-four billion, one hundred forty-two million, seven hundred fifty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •