Base | Representation |
---|---|
bin | 111001111000110011… |
… | …0010010011000110011 |
3 | 102212212112202202111221 |
4 | 1303301212102120303 |
5 | 4014042440231011 |
6 | 133035222445511 |
7 | 11660402136001 |
oct | 1636146223063 |
9 | 385775682457 |
10 | 124312430131 |
11 | 487a214276a |
12 | 20113b93897 |
13 | b951769586 |
14 | 6033d87a71 |
15 | 3378892971 |
hex | 1cf1992633 |
124312430131 has 16 divisors (see below), whose sum is σ = 127955475648. Its totient is φ = 120699417600.
The previous prime is 124312430111. The next prime is 124312430153. The reversal of 124312430131 is 131034213421.
It is a cyclic number.
It is not a de Polignac number, because 124312430131 - 213 = 124312421939 is a prime.
It is a super-2 number, since 2×1243124301312 (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 = 124312430096 and 124312430105.
It is not an unprimeable number, because it can be changed into a prime (124312430111) 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 15 ways as a sum of consecutive naturals, for example, 12039451 + ... + 12049771.
It is an arithmetic number, because the mean of its divisors is an integer number (7997217228).
Almost surely, 2124312430131 is an apocalyptic number.
124312430131 is a deficient number, since it is larger than the sum of its proper divisors (3643045517).
124312430131 is a wasteful number, since it uses less digits than its factorization.
124312430131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11742.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 124312430131 its reverse (131034213421), we get a palindrome (255346643552).
The spelling of 124312430131 in words is "one hundred twenty-four billion, three hundred twelve million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •