Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …111100010110111010101 |
3 | 10222011111122010220212002 |
4 | 100110000333202313111 |
5 | 121331303244402013 |
6 | 2214552015205045 |
7 | 143663334214526 |
oct | 20240077426725 |
9 | 3864448126762 |
10 | 1121003122133 |
11 | 3a2462046574 |
12 | 161311816785 |
13 | 819302441ab |
14 | 3c384ab084d |
15 | 1e25e818358 |
hex | 10500fe2dd5 |
1121003122133 has 8 divisors (see below), whose sum is σ = 1121801140800. Its totient is φ = 1120205228800.
The previous prime is 1121003122073. The next prime is 1121003122153. The reversal of 1121003122133 is 3312213001211.
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 1121003122133 - 216 = 1121003056597 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 (1121003122153) 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 7 ways as a sum of consecutive naturals, for example, 24470816 + ... + 24516582.
It is an arithmetic number, because the mean of its divisors is an integer number (140225142600).
Almost surely, 21121003122133 is an apocalyptic number.
It is an amenable number.
1121003122133 is a deficient number, since it is larger than the sum of its proper divisors (798018667).
1121003122133 is a wasteful number, since it uses less digits than its factorization.
1121003122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62667.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1121003122133 its reverse (3312213001211), we get a palindrome (4433216123344).
The spelling of 1121003122133 in words is "one trillion, one hundred twenty-one billion, three million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •