Base | Representation |
---|---|
bin | 100010000101011110010… |
… | …110000111001101100011 |
3 | 22021220222201000022201202 |
4 | 202011132112013031203 |
5 | 301334103022000311 |
6 | 4552020043551415 |
7 | 331141240521116 |
oct | 42053626071543 |
9 | 8256881008652 |
10 | 2342340031331 |
11 | 823420979313 |
12 | 319b64b2b56b |
13 | 13cb60195551 |
14 | 81526c8c57d |
15 | 40de2800e3b |
hex | 2215e587363 |
2342340031331 has 2 divisors, whose sum is σ = 2342340031332. Its totient is φ = 2342340031330.
The previous prime is 2342340031277. The next prime is 2342340031333. The reversal of 2342340031331 is 1331300432432.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2342340031331 - 222 = 2342335837027 is a prime.
It is a super-2 number, since 2×23423400313312 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 2342340031333, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2342340031294 and 2342340031303.
It is not a weakly prime, because it can be changed into another prime (2342340031333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1171170015665 + 1171170015666.
It is an arithmetic number, because the mean of its divisors is an integer number (1171170015666).
Almost surely, 22342340031331 is an apocalyptic number.
2342340031331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2342340031331 is an equidigital number, since it uses as much as digits as its factorization.
2342340031331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 2342340031331 its reverse (1331300432432), we get a palindrome (3673640463763).
The spelling of 2342340031331 in words is "two trillion, three hundred forty-two billion, three hundred forty million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •