Base | Representation |
---|---|
bin | 111000011001011010… |
… | …1101100100101010011 |
3 | 102120121111122010222200 |
4 | 1300302311230211103 |
5 | 3441014134140311 |
6 | 131345454534243 |
7 | 11515161124050 |
oct | 1606265544523 |
9 | 376544563880 |
10 | 121112021331 |
11 | 473aa640214 |
12 | 1b580207383 |
13 | b5616b6962 |
14 | 5c0ccd4027 |
15 | 323c913556 |
hex | 1c32d6c953 |
121112021331 has 12 divisors (see below), whose sum is σ = 199930955952. Its totient is φ = 69206869296.
The previous prime is 121112021321. The next prime is 121112021377. The reversal of 121112021331 is 133120211121.
121112021331 is a `hidden beast` number, since 1 + 211 + 120 + 2 + 1 + 331 = 666.
It is not a de Polignac number, because 121112021331 - 210 = 121112020307 is a prime.
It is a super-2 number, since 2×1211120213312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121112021321) 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 11 ways as a sum of consecutive naturals, for example, 961206456 + ... + 961206581.
It is an arithmetic number, because the mean of its divisors is an integer number (16660912996).
Almost surely, 2121112021331 is an apocalyptic number.
121112021331 is a deficient number, since it is larger than the sum of its proper divisors (78818934621).
121112021331 is a wasteful number, since it uses less digits than its factorization.
121112021331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1922413050 (or 1922413047 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 121112021331 its reverse (133120211121), we get a palindrome (254232232452).
The spelling of 121112021331 in words is "one hundred twenty-one billion, one hundred twelve million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •