Base | Representation |
---|---|
bin | 11011100010011001011010… |
… | …010000111011110000100010 |
3 | 120212211002122222102112021122 |
4 | 123202121122100323300202 |
5 | 111333240313030413442 |
6 | 1105325343141452242 |
7 | 34336660352112623 |
oct | 3342313220736042 |
9 | 525732588375248 |
10 | 121111002201122 |
11 | 356539844267aa |
12 | 11700159711082 |
13 | 527694572040b |
14 | 21c9b3781ba4a |
15 | e00595e7cdd2 |
hex | 6e265a43bc22 |
121111002201122 has 8 divisors (see below), whose sum is σ = 192352768201836. Its totient is φ = 56993412800512.
The previous prime is 121111002201121. The next prime is 121111002201191. The reversal of 121111002201122 is 221102200111121.
It can be written as a sum of positive squares in 2 ways, for example, as 118138443460801 + 2972558740321 = 10869151^2 + 1724111^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 121111002201122.
It is not an unprimeable number, because it can be changed into a prime (121111002201121) 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, 1781044149983 + ... + 1781044150050.
Almost surely, 2121111002201122 is an apocalyptic number.
121111002201122 is a deficient number, since it is larger than the sum of its proper divisors (71241766000714).
121111002201122 is a wasteful number, since it uses less digits than its factorization.
121111002201122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3562088300052.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121111002201122 its reverse (221102200111121), we get a palindrome (342213202312243).
The spelling of 121111002201122 in words is "one hundred twenty-one trillion, one hundred eleven billion, two million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •