Base | Representation |
---|---|
bin | 1011000010001111010101… |
… | …0011010000101111010001 |
3 | 1120221220122211001201121210 |
4 | 2300203311103100233101 |
5 | 3042242043344023441 |
6 | 41445512015410333 |
7 | 2361405414543036 |
oct | 260436523205721 |
9 | 46856584051553 |
10 | 12133103111121 |
11 | 3958690440283 |
12 | 143b5878239a9 |
13 | 6a01ba43b535 |
14 | 2dd36125138d |
15 | 1609233e4616 |
hex | b08f54d0bd1 |
12133103111121 has 8 divisors (see below), whose sum is σ = 17129086745184. Its totient is φ = 7612927442240.
The previous prime is 12133103111117. The next prime is 12133103111131. The reversal of 12133103111121 is 12111130133121.
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 12133103111121 - 22 = 12133103111117 is a prime.
It is a super-2 number, since 2×121331031111212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12133103111131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118951991235 + ... + 118951991336.
It is an arithmetic number, because the mean of its divisors is an integer number (2141135843148).
Almost surely, 212133103111121 is an apocalyptic number.
It is an amenable number.
12133103111121 is a deficient number, since it is larger than the sum of its proper divisors (4995983634063).
12133103111121 is a wasteful number, since it uses less digits than its factorization.
12133103111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237903982591.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 12133103111121 its reverse (12111130133121), we get a palindrome (24244233244242).
The spelling of 12133103111121 in words is "twelve trillion, one hundred thirty-three billion, one hundred three million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •