Base | Representation |
---|---|
bin | 111001110111100100… |
… | …0010101001000100111 |
3 | 102212202122212001002211 |
4 | 1303233020111020213 |
5 | 4014001340211011 |
6 | 133031143144251 |
7 | 11656360156300 |
oct | 1635710251047 |
9 | 385678761084 |
10 | 124271022631 |
11 | 48780830698 |
12 | 20102145087 |
13 | b945ccc1b2 |
14 | 602c6897a7 |
15 | 3374e13b21 |
hex | 1cef215227 |
124271022631 has 6 divisors (see below), whose sum is σ = 144560169240. Its totient is φ = 106518019356.
The previous prime is 124271022599. The next prime is 124271022683. The reversal of 124271022631 is 136220172421.
It is a happy number.
It is not a de Polignac number, because 124271022631 - 25 = 124271022599 is a prime.
It is a super-2 number, since 2×1242710226312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124271022593 and 124271022602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124271023631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1268071611 + ... + 1268071708.
It is an arithmetic number, because the mean of its divisors is an integer number (24093361540).
Almost surely, 2124271022631 is an apocalyptic number.
124271022631 is a deficient number, since it is larger than the sum of its proper divisors (20289146609).
124271022631 is an equidigital number, since it uses as much as digits as its factorization.
124271022631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536143333 (or 2536143326 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 31.
The spelling of 124271022631 in words is "one hundred twenty-four billion, two hundred seventy-one million, twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •