Base | Representation |
---|---|
bin | 1111101100100001… |
… | …1110110000010101 |
3 | 101212122002000222221 |
4 | 3323020132300111 |
5 | 32112101214331 |
6 | 1534025422341 |
7 | 206260332061 |
oct | 37310366025 |
9 | 11778060887 |
10 | 4213304341 |
11 | 1872333a04 |
12 | 99703a9b1 |
13 | 521b865bc |
14 | 2bd7daaa1 |
15 | 199d5b711 |
hex | fb21ec15 |
4213304341 has 2 divisors, whose sum is σ = 4213304342. Its totient is φ = 4213304340.
The previous prime is 4213304339. The next prime is 4213304351. The reversal of 4213304341 is 1434033124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4206041316 + 7263025 = 64854^2 + 2695^2 .
It is a cyclic number.
It is not a de Polignac number, because 4213304341 - 21 = 4213304339 is a prime.
Together with 4213304339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4213304351) 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, 2106652170 + 2106652171.
It is an arithmetic number, because the mean of its divisors is an integer number (2106652171).
Almost surely, 24213304341 is an apocalyptic number.
It is an amenable number.
4213304341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4213304341 is an equidigital number, since it uses as much as digits as its factorization.
4213304341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 4213304341 is about 64909.9710445167. The cubic root of 4213304341 is about 1615.1304697670.
Adding to 4213304341 its reverse (1434033124), we get a palindrome (5647337465).
The spelling of 4213304341 in words is "four billion, two hundred thirteen million, three hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •