Base | Representation |
---|---|
bin | 10000010111001101111… |
… | …101111010100001010111 |
3 | 10222111101022001020101202 |
4 | 100113031331322201113 |
5 | 121410324124232043 |
6 | 2220321142543115 |
7 | 144144502334543 |
oct | 20271575724127 |
9 | 3874338036352 |
10 | 1124442024023 |
11 | 3a396723244a |
12 | 161b11437a9b |
13 | 8205a83aa96 |
14 | 3c5cd6c6a23 |
15 | 1e3b16a71b8 |
hex | 105cdf7a857 |
1124442024023 has 8 divisors (see below), whose sum is σ = 1127289030336. Its totient is φ = 1121595232000.
The previous prime is 1124442023953. The next prime is 1124442024029. The reversal of 1124442024023 is 3204202444211.
It is a happy number.
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 1124442024023 - 28 = 1124442023767 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 (1124442024029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18697883 + ... + 18757923.
It is an arithmetic number, because the mean of its divisors is an integer number (140911128792).
Almost surely, 21124442024023 is an apocalyptic number.
1124442024023 is a deficient number, since it is larger than the sum of its proper divisors (2847006313).
1124442024023 is an equidigital number, since it uses as much as digits as its factorization.
1124442024023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107145.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 1124442024023 its reverse (3204202444211), we get a palindrome (4328644468234).
The spelling of 1124442024023 in words is "one trillion, one hundred twenty-four billion, four hundred forty-two million, twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •