Base | Representation |
---|---|
bin | 111001110000001011… |
… | …0010010011101010001 |
3 | 102212010101012101011122 |
4 | 1303200112102131101 |
5 | 4012444343222231 |
6 | 132550403452025 |
7 | 11650256206502 |
oct | 1634026223521 |
9 | 385111171148 |
10 | 124023023441 |
11 | 48663844189 |
12 | 20053087015 |
13 | b90680a405 |
14 | 6007770ba9 |
15 | 335d27777b |
hex | 1ce0592751 |
124023023441 has 8 divisors (see below), whose sum is σ = 129672627840. Its totient is φ = 118394860672.
The previous prime is 124023023419. The next prime is 124023023521. The reversal of 124023023441 is 144320320421.
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 124023023441 - 218 = 124022761297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 124023023441.
It is not an unprimeable number, because it can be changed into a prime (124023023141) 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 7 ways as a sum of consecutive naturals, for example, 5348576 + ... + 5371713.
It is an arithmetic number, because the mean of its divisors is an integer number (16209078480).
Almost surely, 2124023023441 is an apocalyptic number.
It is an amenable number.
124023023441 is a deficient number, since it is larger than the sum of its proper divisors (5649604399).
124023023441 is a wasteful number, since it uses less digits than its factorization.
124023023441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10720815.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 124023023441 its reverse (144320320421), we get a palindrome (268343343862).
The spelling of 124023023441 in words is "one hundred twenty-four billion, twenty-three million, twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •