Base | Representation |
---|---|
bin | 1001111011101111110… |
… | …10000000111100110011 |
3 | 1012121222202201102211201 |
4 | 10331313322000330303 |
5 | 21043002403111311 |
6 | 420444133552031 |
7 | 33442040044342 |
oct | 4756772007463 |
9 | 1177882642751 |
10 | 341314113331 |
11 | 121828a12114 |
12 | 561954a5617 |
13 | 2625521b009 |
14 | 1273c065b59 |
15 | 8d297229c1 |
hex | 4f77e80f33 |
341314113331 has 2 divisors, whose sum is σ = 341314113332. Its totient is φ = 341314113330.
The previous prime is 341314113271. The next prime is 341314113353. The reversal of 341314113331 is 133311413143.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-341314113331 is a prime.
It is a super-2 number, since 2×3413141133312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 341314113331.
It is not a weakly prime, because it can be changed into another prime (341314113631) 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, 170657056665 + 170657056666.
It is an arithmetic number, because the mean of its divisors is an integer number (170657056666).
Almost surely, 2341314113331 is an apocalyptic number.
341314113331 is a deficient number, since it is larger than the sum of its proper divisors (1).
341314113331 is an equidigital number, since it uses as much as digits as its factorization.
341314113331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 28.
Adding to 341314113331 its reverse (133311413143), we get a palindrome (474625526474).
The spelling of 341314113331 in words is "three hundred forty-one billion, three hundred fourteen million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •