Base | Representation |
---|---|
bin | 111001111100101110… |
… | …1000010101010000011 |
3 | 102220012201202120220012 |
4 | 1303321131002222003 |
5 | 4014330210133011 |
6 | 133100251335135 |
7 | 11663562311033 |
oct | 1637135025203 |
9 | 386181676805 |
10 | 124444224131 |
11 | 4885a57a527 |
12 | 201501514ab |
13 | b972b627a6 |
14 | 60476938c3 |
15 | 3385227a8b |
hex | 1cf9742a83 |
124444224131 has 8 divisors (see below), whose sum is σ = 125839006704. Its totient is φ = 123052631200.
The previous prime is 124444224077. The next prime is 124444224161. The reversal of 124444224131 is 131422444421.
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 124444224131 - 230 = 123370482307 is a prime.
It is a super-2 number, since 2×1244442241312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124444224161) 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 7 ways as a sum of consecutive naturals, for example, 718901 + ... + 875046.
It is an arithmetic number, because the mean of its divisors is an integer number (15729875838).
Almost surely, 2124444224131 is an apocalyptic number.
124444224131 is a deficient number, since it is larger than the sum of its proper divisors (1394782573).
124444224131 is a wasteful number, since it uses less digits than its factorization.
124444224131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594821.
The product of its digits is 24576, while the sum is 32.
Adding to 124444224131 its reverse (131422444421), we get a palindrome (255866668552).
The spelling of 124444224131 in words is "one hundred twenty-four billion, four hundred forty-four million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •