Base | Representation |
---|---|
bin | 10000010111001100101… |
… | …101101110001110010101 |
3 | 10222111022211111012210020 |
4 | 100113030231232032111 |
5 | 121410303234032013 |
6 | 2220315112215353 |
7 | 144144125551332 |
oct | 20271455561625 |
9 | 3874284435706 |
10 | 1124421002133 |
11 | 3a3956384390 |
12 | 161b0639a559 |
13 | 8205638a4b0 |
14 | 3c5ca9b3989 |
15 | 1e3ae903623 |
hex | 105ccb6e395 |
1124421002133 has 128 divisors (see below), whose sum is σ = 1858781675520. Its totient is φ = 595455840000.
The previous prime is 1124421002129. The next prime is 1124421002137. The reversal of 1124421002133 is 3312001244211.
It is an interprime number because it is at equal distance from previous prime (1124421002129) and next prime (1124421002137).
It is not a de Polignac number, because 1124421002133 - 22 = 1124421002129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124421002137) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 77267208 + ... + 77281758.
It is an arithmetic number, because the mean of its divisors is an integer number (14521731840).
Almost surely, 21124421002133 is an apocalyptic number.
1124421002133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1124421002133 is a deficient number, since it is larger than the sum of its proper divisors (734360673387).
1124421002133 is a wasteful number, since it uses less digits than its factorization.
1124421002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14751.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1124421002133 its reverse (3312001244211), we get a palindrome (4436422246344).
The spelling of 1124421002133 in words is "one trillion, one hundred twenty-four billion, four hundred twenty-one million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •