Base | Representation |
---|---|
bin | 10000010110110100111… |
… | …001000011111011001111 |
3 | 10222110021222102022220222 |
4 | 100112310321003323033 |
5 | 121403443424241143 |
6 | 2220211313501555 |
7 | 144131203406420 |
oct | 20266471037317 |
9 | 3873258368828 |
10 | 1124021321423 |
11 | 3a3770807350 |
12 | 161a145718bb |
13 | 81cc162b330 |
14 | 3c58d893647 |
15 | 1e3897a4768 |
hex | 105b4e43ecf |
1124021321423 has 32 divisors (see below), whose sum is σ = 1588605795840. Its totient is φ = 765934911360.
The previous prime is 1124021321399. The next prime is 1124021321429. The reversal of 1124021321423 is 3241231204211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1124021321423 - 216 = 1124021255887 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1124021321392 and 1124021321401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124021321429) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29530940 + ... + 29568977.
It is an arithmetic number, because the mean of its divisors is an integer number (49643931120).
Almost surely, 21124021321423 is an apocalyptic number.
1124021321423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1124021321423 is a deficient number, since it is larger than the sum of its proper divisors (464584474417).
1124021321423 is a wasteful number, since it uses less digits than its factorization.
1124021321423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59099967.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1124021321423 its reverse (3241231204211), we get a palindrome (4365252525634).
The spelling of 1124021321423 in words is "one trillion, one hundred twenty-four billion, twenty-one million, three hundred twenty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •