Base | Representation |
---|---|
bin | 10000010111000101100… |
… | …111111000110100000101 |
3 | 10222111000112121220121221 |
4 | 100113011213320310011 |
5 | 121410032310012013 |
6 | 2220255222240341 |
7 | 144141152410120 |
oct | 20270547706405 |
9 | 3874015556557 |
10 | 1124302032133 |
11 | 3a38a5206475 |
12 | 161a925860b1 |
13 | 82037834347 |
14 | 3c5b8c853b7 |
15 | 1e3a425308d |
hex | 105c59f8d05 |
1124302032133 has 16 divisors (see below), whose sum is σ = 1323126110080. Its totient is φ = 935167778496.
The previous prime is 1124302032107. The next prime is 1124302032157. The reversal of 1124302032133 is 3312302034211.
It is a de Polignac number, because none of the positive numbers 2k-1124302032133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1124302032098 and 1124302032107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124302932133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5628666 + ... + 5824987.
It is an arithmetic number, because the mean of its divisors is an integer number (82695381880).
Almost surely, 21124302032133 is an apocalyptic number.
It is an amenable number.
1124302032133 is a deficient number, since it is larger than the sum of its proper divisors (198824077947).
1124302032133 is a wasteful number, since it uses less digits than its factorization.
1124302032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11454076.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1124302032133 its reverse (3312302034211), we get a palindrome (4436604066344).
The spelling of 1124302032133 in words is "one trillion, one hundred twenty-four billion, three hundred two million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •