Base | Representation |
---|---|
bin | 11011100101010011000011… |
… | …010100110001100001000011 |
3 | 120220112011011201002002002102 |
4 | 123211103003110301201003 |
5 | 111400022030311423133 |
6 | 1110001110415141015 |
7 | 34360245101436032 |
oct | 3345230324614103 |
9 | 526464151062072 |
10 | 121310333311043 |
11 | 35720472666988 |
12 | 1173290921476b |
13 | 528c6912a3436 |
14 | 21d5646b42719 |
15 | e058608277e8 |
hex | 6e54c3531843 |
121310333311043 has 2 divisors, whose sum is σ = 121310333311044. Its totient is φ = 121310333311042.
The previous prime is 121310333310997. The next prime is 121310333311081. The reversal of 121310333311043 is 340113333013121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121310333311043 - 26 = 121310333310979 is a prime.
It is a super-2 number, since 2×1213103333110432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121310333310997 and 121310333311015.
It is not a weakly prime, because it can be changed into another prime (121310333314043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655166655521 + 60655166655522.
It is an arithmetic number, because the mean of its divisors is an integer number (60655166655522).
Almost surely, 2121310333311043 is an apocalyptic number.
121310333311043 is a deficient number, since it is larger than the sum of its proper divisors (1).
121310333311043 is an equidigital number, since it uses as much as digits as its factorization.
121310333311043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 121310333311043 its reverse (340113333013121), we get a palindrome (461423666324164).
The spelling of 121310333311043 in words is "one hundred twenty-one trillion, three hundred ten billion, three hundred thirty-three million, three hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •