Base | Representation |
---|---|
bin | 11100001100110001101101… |
… | …100010001110111101100101 |
3 | 121021010111211221121121110001 |
4 | 130030301231202032331211 |
5 | 112223444221203030041 |
6 | 1115435305032301301 |
7 | 35060250215215420 |
oct | 3414615542167545 |
9 | 537114757547401 |
10 | 124023313330021 |
11 | 36576aa0103776 |
12 | 11ab0670841831 |
13 | 542846b19b831 |
14 | 228aa907409b7 |
15 | e511e71b4131 |
hex | 70cc6d88ef65 |
124023313330021 has 8 divisors (see below), whose sum is σ = 150078631256640. Its totient is φ = 100052420837568.
The previous prime is 124023313329989. The next prime is 124023313330073. The reversal of 124023313330021 is 120033313320421.
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 124023313330021 - 25 = 124023313329989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124023313330621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 521106358411 + ... + 521106358648.
It is an arithmetic number, because the mean of its divisors is an integer number (18759828907080).
Almost surely, 2124023313330021 is an apocalyptic number.
It is an amenable number.
124023313330021 is a deficient number, since it is larger than the sum of its proper divisors (26055317926619).
124023313330021 is a wasteful number, since it uses less digits than its factorization.
124023313330021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042212717083.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 124023313330021 its reverse (120033313320421), we get a palindrome (244056626650442).
The spelling of 124023313330021 in words is "one hundred twenty-four trillion, twenty-three billion, three hundred thirteen million, three hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •