Base | Representation |
---|---|
bin | 11011100101101000011100… |
… | …110111000111101000001101 |
3 | 120220121100111000101020022011 |
4 | 123211220130313013220031 |
5 | 111400411104420320323 |
6 | 1110015430412221221 |
7 | 34362020353013512 |
oct | 3345503467075015 |
9 | 526540430336264 |
10 | 121333310323213 |
11 | 3572a19358523a |
12 | 1173726016a811 |
13 | 52918b3674221 |
14 | 21d67c6569309 |
15 | e06257ae620d |
hex | 6e5a1cdc7a0d |
121333310323213 has 2 divisors, whose sum is σ = 121333310323214. Its totient is φ = 121333310323212.
The previous prime is 121333310323207. The next prime is 121333310323229. The reversal of 121333310323213 is 312323013333121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112212559999849 + 9120750323364 = 10593043^2 + 3020058^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121333310323213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121333310023213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60666655161606 + 60666655161607.
It is an arithmetic number, because the mean of its divisors is an integer number (60666655161607).
Almost surely, 2121333310323213 is an apocalyptic number.
It is an amenable number.
121333310323213 is a deficient number, since it is larger than the sum of its proper divisors (1).
121333310323213 is an equidigital number, since it uses as much as digits as its factorization.
121333310323213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 31.
Adding to 121333310323213 its reverse (312323013333121), we get a palindrome (433656323656334).
The spelling of 121333310323213 in words is "one hundred twenty-one trillion, three hundred thirty-three billion, three hundred ten million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •