Base | Representation |
---|---|
bin | 11011100010010000011000… |
… | …100101010100001101110011 |
3 | 120212210011122112102121122120 |
4 | 123202100120211110031303 |
5 | 111333110440420011311 |
6 | 1105321101323005323 |
7 | 34336165235325165 |
oct | 3342203045241563 |
9 | 525704575377576 |
10 | 121101310313331 |
11 | 3564a860626a87 |
12 | 116ba2b3969843 |
13 | 5275a5c81127a |
14 | 21c9498580935 |
15 | e001ca182706 |
hex | 6e2418954373 |
121101310313331 has 4 divisors (see below), whose sum is σ = 161468413751112. Its totient is φ = 80734206875552.
The previous prime is 121101310313303. The next prime is 121101310313411. The reversal of 121101310313331 is 133313013101121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121101310313331 - 215 = 121101310280563 is a prime.
It is a super-2 number, since 2×1211013103133312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121101310313131) 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, 20183551718886 + ... + 20183551718891.
It is an arithmetic number, because the mean of its divisors is an integer number (40367103437778).
Almost surely, 2121101310313331 is an apocalyptic number.
121101310313331 is a deficient number, since it is larger than the sum of its proper divisors (40367103437781).
121101310313331 is an equidigital number, since it uses as much as digits as its factorization.
121101310313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40367103437780.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 121101310313331 its reverse (133313013101121), we get a palindrome (254414323414452).
The spelling of 121101310313331 in words is "one hundred twenty-one trillion, one hundred one billion, three hundred ten million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •