Base | Representation |
---|---|
bin | 100001111110111101001… |
… | …001010011010101011001 |
3 | 22021020220220022001101212 |
4 | 201332331021103111121 |
5 | 301230234141332131 |
6 | 4544501325152505 |
7 | 330502626232106 |
oct | 41767511232531 |
9 | 8236826261355 |
10 | 2335340574041 |
11 | 820459965472 |
12 | 3187309bb735 |
13 | 13c2b601c647 |
14 | 81061433aad |
15 | 40b33092a2b |
hex | 21fbd253559 |
2335340574041 has 2 divisors, whose sum is σ = 2335340574042. Its totient is φ = 2335340574040.
The previous prime is 2335340573971. The next prime is 2335340574089. The reversal of 2335340574041 is 1404750435332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1360421309641 + 974919264400 = 1166371^2 + 987380^2 .
It is a cyclic number.
It is not a de Polignac number, because 2335340574041 - 210 = 2335340573017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2335340574041.
It is not a weakly prime, because it can be changed into another prime (2335340574841) 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, 1167670287020 + 1167670287021.
It is an arithmetic number, because the mean of its divisors is an integer number (1167670287021).
Almost surely, 22335340574041 is an apocalyptic number.
It is an amenable number.
2335340574041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2335340574041 is an equidigital number, since it uses as much as digits as its factorization.
2335340574041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 604800, while the sum is 41.
The spelling of 2335340574041 in words is "two trillion, three hundred thirty-five billion, three hundred forty million, five hundred seventy-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •