Base | Representation |
---|---|
bin | 1100011100101001… |
… | …1011110001000111 |
3 | 22121212102202200111 |
4 | 3013022123301013 |
5 | 23320344314114 |
6 | 1311321453451 |
7 | 145542304225 |
oct | 30712336107 |
9 | 8555382614 |
10 | 3341401159 |
11 | 1465152168 |
12 | 793041287 |
13 | 413349865 |
14 | 239ab5b15 |
15 | 14852ebc4 |
hex | c729bc47 |
3341401159 has 2 divisors, whose sum is σ = 3341401160. Its totient is φ = 3341401158.
The previous prime is 3341401121. The next prime is 3341401163. The reversal of 3341401159 is 9511041433.
It is a strong prime.
It is an emirp because it is prime and its reverse (9511041433) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3341401159 - 225 = 3307846727 is a prime.
It is a super-2 number, since 2×33414011592 = 22329923410733086562, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3341401159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3341401759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1670700579 + 1670700580.
It is an arithmetic number, because the mean of its divisors is an integer number (1670700580).
Almost surely, 23341401159 is an apocalyptic number.
3341401159 is a deficient number, since it is larger than the sum of its proper divisors (1).
3341401159 is an equidigital number, since it uses as much as digits as its factorization.
3341401159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 3341401159 is about 57804.8541127819. The cubic root of 3341401159 is about 1495.0057842530.
The spelling of 3341401159 in words is "three billion, three hundred forty-one million, four hundred one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •