Base | Representation |
---|---|
bin | 100001111011000010100… |
… | …011110011101011101101 |
3 | 22020212001220110222011021 |
4 | 201323002203303223231 |
5 | 301143131412103234 |
6 | 4542524224054141 |
7 | 330263506545502 |
oct | 41730243635355 |
9 | 8225056428137 |
10 | 2331136441069 |
11 | 8196a1826107 |
12 | 317958a64351 |
13 | 13ba960276b7 |
14 | 80b82d434a9 |
15 | 40988e489b4 |
hex | 21ec28f3aed |
2331136441069 has 2 divisors, whose sum is σ = 2331136441070. Its totient is φ = 2331136441068.
The previous prime is 2331136441043. The next prime is 2331136441097. The reversal of 2331136441069 is 9601446311332.
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., 1381365349225 + 949771091844 = 1175315^2 + 974562^2 .
It is a cyclic number.
It is not a de Polignac number, because 2331136441069 - 221 = 2331134343917 is a prime.
It is a super-2 number, since 2×23311364410692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2331136741069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1165568220534 + 1165568220535.
It is an arithmetic number, because the mean of its divisors is an integer number (1165568220535).
Almost surely, 22331136441069 is an apocalyptic number.
It is an amenable number.
2331136441069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2331136441069 is an equidigital number, since it uses as much as digits as its factorization.
2331136441069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 43.
The spelling of 2331136441069 in words is "two trillion, three hundred thirty-one billion, one hundred thirty-six million, four hundred forty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •