Base | Representation |
---|---|
bin | 1001101001001010111… |
… | …10111100110101111001 |
3 | 1011200020202012200120112 |
4 | 10310211132330311321 |
5 | 20412041341233223 |
6 | 412114403034105 |
7 | 32636643011336 |
oct | 4644536746571 |
9 | 1150222180515 |
10 | 331341352313 |
11 | 118580612164 |
12 | 5427166b935 |
13 | 25326079baa |
14 | 1207379398d |
15 | 8943e45778 |
hex | 4d257bcd79 |
331341352313 has 2 divisors, whose sum is σ = 331341352314. Its totient is φ = 331341352312.
The previous prime is 331341352297. The next prime is 331341352343. The reversal of 331341352313 is 313253143133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 275460174649 + 55881177664 = 524843^2 + 236392^2 .
It is a cyclic number.
It is not a de Polignac number, because 331341352313 - 24 = 331341352297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 331341352313.
It is not a weakly prime, because it can be changed into another prime (331341352343) 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, 165670676156 + 165670676157.
It is an arithmetic number, because the mean of its divisors is an integer number (165670676157).
Almost surely, 2331341352313 is an apocalyptic number.
It is an amenable number.
331341352313 is a deficient number, since it is larger than the sum of its proper divisors (1).
331341352313 is an equidigital number, since it uses as much as digits as its factorization.
331341352313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 32.
Adding to 331341352313 its reverse (313253143133), we get a palindrome (644594495446).
The spelling of 331341352313 in words is "three hundred thirty-one billion, three hundred forty-one million, three hundred fifty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •