Base | Representation |
---|---|
bin | 111110101111111001100… |
… | …111101010001111110011 |
3 | 120021020010111020021010221 |
4 | 332233321213222033303 |
5 | 1031122024232340311 |
6 | 13100531320433511 |
7 | 623351242164145 |
oct | 76577147521763 |
9 | 16236114207127 |
10 | 4312040121331 |
11 | 14127a9263268 |
12 | 597851618897 |
13 | 253815198997 |
14 | 10c9bd544c95 |
15 | 772756b2671 |
hex | 3ebf99ea3f3 |
4312040121331 has 2 divisors, whose sum is σ = 4312040121332. Its totient is φ = 4312040121330.
The previous prime is 4312040121289. The next prime is 4312040121421. The reversal of 4312040121331 is 1331210402134.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4312040121331 - 27 = 4312040121203 is a prime.
It is a super-2 number, since 2×43120401213312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4312040121296 and 4312040121305.
It is not a weakly prime, because it can be changed into another prime (4312040124331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2156020060665 + 2156020060666.
It is an arithmetic number, because the mean of its divisors is an integer number (2156020060666).
Almost surely, 24312040121331 is an apocalyptic number.
4312040121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
4312040121331 is an equidigital number, since it uses as much as digits as its factorization.
4312040121331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4312040121331 its reverse (1331210402134), we get a palindrome (5643250523465).
The spelling of 4312040121331 in words is "four trillion, three hundred twelve billion, forty million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •