Base | Representation |
---|---|
bin | 11011100101010101110000… |
… | …000111100111101001001101 |
3 | 120220112102122202002001021022 |
4 | 123211111300013213221031 |
5 | 111400043444433233401 |
6 | 1110002310215043525 |
7 | 34360406662554302 |
oct | 3345256007475115 |
9 | 526472582061238 |
10 | 121313232321101 |
11 | 3572172001a067 |
12 | 117333980705a5 |
13 | 528ca33a886c2 |
14 | 21d583db7b0a9 |
15 | e059800bd71b |
hex | 6e55701e7a4d |
121313232321101 has 8 divisors (see below), whose sum is σ = 126589680795840. Its totient is φ = 116036947189152.
The previous prime is 121313232321079. The next prime is 121313232321161. The reversal of 121313232321101 is 101123232313121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121313232321101 - 214 = 121313232304717 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 (121313232321161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39316811 + ... + 42289928.
It is an arithmetic number, because the mean of its divisors is an integer number (15823710099480).
Almost surely, 2121313232321101 is an apocalyptic number.
It is an amenable number.
121313232321101 is a deficient number, since it is larger than the sum of its proper divisors (5276448474739).
121313232321101 is an equidigital number, since it uses as much as digits as its factorization.
121313232321101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81671395.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 121313232321101 its reverse (101123232313121), we get a palindrome (222436464634222).
The spelling of 121313232321101 in words is "one hundred twenty-one trillion, three hundred thirteen billion, two hundred thirty-two million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •