Base | Representation |
---|---|
bin | 11011100010010000011000… |
… | …100101010001101110011011 |
3 | 120212210011122112102002122210 |
4 | 123202100120211101232123 |
5 | 111333110440414200011 |
6 | 1105321101322450203 |
7 | 34336165235253354 |
oct | 3342203045215633 |
9 | 525704575362583 |
10 | 121101310303131 |
11 | 3564a86061a354 |
12 | 116ba2b3963963 |
13 | 5275a5c809732 |
14 | 21c949857ad2b |
15 | e001ca17e6a6 |
hex | 6e2418951b9b |
121101310303131 has 64 divisors (see below), whose sum is σ = 175237971148800. Its totient is φ = 74149112192256.
The previous prime is 121101310303073. The next prime is 121101310303147. The reversal of 121101310303131 is 131303013101121.
It is not a de Polignac number, because 121101310303131 - 26 = 121101310303067 is a prime.
It is a super-2 number, since 2×1211013103031312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121101310303098 and 121101310303107.
It is not an unprimeable number, because it can be changed into a prime (121101310303151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2211182110 + ... + 2211236876.
It is an arithmetic number, because the mean of its divisors is an integer number (2738093299200).
Almost surely, 2121101310303131 is an apocalyptic number.
121101310303131 is a deficient number, since it is larger than the sum of its proper divisors (54136660845669).
121101310303131 is a wasteful number, since it uses less digits than its factorization.
121101310303131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63928.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 121101310303131 its reverse (131303013101121), we get a palindrome (252404323404252).
The spelling of 121101310303131 in words is "one hundred twenty-one trillion, one hundred one billion, three hundred ten million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •