Base | Representation |
---|---|
bin | 111001111100000100… |
… | …1110101000001001001 |
3 | 102220011012201022222000 |
4 | 1303320021311001021 |
5 | 4014304114112223 |
6 | 133054152021213 |
7 | 11663206015635 |
oct | 1637011650111 |
9 | 386135638860 |
10 | 124422410313 |
11 | 48849230483 |
12 | 20144991809 |
13 | b96b4958c6 |
14 | 6044815dc5 |
15 | 3383369543 |
hex | 1cf8275049 |
124422410313 has 16 divisors (see below), whose sum is σ = 185120619840. Its totient is φ = 82592268192.
The previous prime is 124422410269. The next prime is 124422410351. The reversal of 124422410313 is 313014224421.
124422410313 is a `hidden beast` number, since 1 + 244 + 2 + 2 + 410 + 3 + 1 + 3 = 666.
It is not a de Polignac number, because 124422410313 - 213 = 124422402121 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (124422410363) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 9882631 + ... + 9895212.
It is an arithmetic number, because the mean of its divisors is an integer number (11570038740).
Almost surely, 2124422410313 is an apocalyptic number.
It is an amenable number.
124422410313 is a deficient number, since it is larger than the sum of its proper divisors (60698209527).
124422410313 is a wasteful number, since it uses less digits than its factorization.
124422410313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19778085 (or 19778079 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 124422410313 its reverse (313014224421), we get a palindrome (437436634734).
The spelling of 124422410313 in words is "one hundred twenty-four billion, four hundred twenty-two million, four hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •