Base | Representation |
---|---|
bin | 100001111011001101001… |
… | …100101010011011011101 |
3 | 22020212112100022210122122 |
4 | 201323031030222123131 |
5 | 301144013110020404 |
6 | 4542554041352325 |
7 | 330301104612605 |
oct | 41731514523335 |
9 | 8225470283578 |
10 | 2331314923229 |
11 | 819783551426 |
12 | 3179a87986a5 |
13 | 13bac3cb9746 |
14 | 80b9c923c05 |
15 | 409999523be |
hex | 21ecd32a6dd |
2331314923229 has 2 divisors, whose sum is σ = 2331314923230. Its totient is φ = 2331314923228.
The previous prime is 2331314923199. The next prime is 2331314923237. The reversal of 2331314923229 is 9223294131332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1976245524100 + 355069399129 = 1405790^2 + 595877^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2331314923229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2331314923229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2331314923279) 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, 1165657461614 + 1165657461615.
It is an arithmetic number, because the mean of its divisors is an integer number (1165657461615).
Almost surely, 22331314923229 is an apocalyptic number.
It is an amenable number.
2331314923229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2331314923229 is an equidigital number, since it uses as much as digits as its factorization.
2331314923229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 419904, while the sum is 44.
The spelling of 2331314923229 in words is "two trillion, three hundred thirty-one billion, three hundred fourteen million, nine hundred twenty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •