Base | Representation |
---|---|
bin | 111000011001011011… |
… | …0000111011000111101 |
3 | 102120121111211201121102 |
4 | 1300302312013120331 |
5 | 3441014201144013 |
6 | 131345501142445 |
7 | 11515162062140 |
oct | 1606266073075 |
9 | 376544751542 |
10 | 121112131133 |
11 | 473aa705764 |
12 | 1b58025aa25 |
13 | b561724926 |
14 | 5c0cd22057 |
15 | 323c935d58 |
hex | 1c32d8763d |
121112131133 has 4 divisors (see below), whose sum is σ = 138413864160. Its totient is φ = 103810398108.
The previous prime is 121112131069. The next prime is 121112131139. The reversal of 121112131133 is 331131211121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 331131211121 = 239 ⋅1385486239.
It is a cyclic number.
It is not a de Polignac number, because 121112131133 - 26 = 121112131069 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 (121112131139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8650866503 + ... + 8650866516.
It is an arithmetic number, because the mean of its divisors is an integer number (34603466040).
Almost surely, 2121112131133 is an apocalyptic number.
It is an amenable number.
121112131133 is a deficient number, since it is larger than the sum of its proper divisors (17301733027).
121112131133 is an equidigital number, since it uses as much as digits as its factorization.
121112131133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17301733026.
The product of its digits is 108, while the sum is 20.
Adding to 121112131133 its reverse (331131211121), we get a palindrome (452243342254).
The spelling of 121112131133 in words is "one hundred twenty-one billion, one hundred twelve million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •