Base | Representation |
---|---|
bin | 10000010110111001100… |
… | …110110011100111110101 |
3 | 10222110111111021001200220 |
4 | 100112321212303213311 |
5 | 121404124202002013 |
6 | 2220223221124553 |
7 | 144133153635633 |
oct | 20267146634765 |
9 | 3873444231626 |
10 | 1124100422133 |
11 | 3a3801423937 |
12 | 161a36b59759 |
13 | 82004b352a0 |
14 | 3c59a1a4353 |
15 | 1e3916cbb23 |
hex | 105b99b39f5 |
1124100422133 has 32 divisors (see below), whose sum is σ = 1619367568896. Its totient is φ = 689497256448.
The previous prime is 1124100422129. The next prime is 1124100422149. The reversal of 1124100422133 is 3312240014211.
It is not a de Polignac number, because 1124100422133 - 22 = 1124100422129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124100422633) 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 31 ways as a sum of consecutive naturals, for example, 14712516 + ... + 14788722.
It is an arithmetic number, because the mean of its divisors is an integer number (50605236528).
Almost surely, 21124100422133 is an apocalyptic number.
1124100422133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1124100422133 is a deficient number, since it is larger than the sum of its proper divisors (495267146763).
1124100422133 is a wasteful number, since it uses less digits than its factorization.
1124100422133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77453.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1124100422133 its reverse (3312240014211), we get a palindrome (4436340436344).
The spelling of 1124100422133 in words is "one trillion, one hundred twenty-four billion, one hundred million, four hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •