Base | Representation |
---|---|
bin | 111101010011111100100… |
… | …011001000001000001001 |
3 | 112220210021110201021100002 |
4 | 331103330203020020021 |
5 | 1023012322041014331 |
6 | 12543322100452345 |
7 | 613254424510514 |
oct | 75237443101011 |
9 | 15823243637302 |
10 | 4213305016841 |
11 | 1384941928958 |
12 | 5806973aa0b5 |
13 | 24740b752a2b |
14 | 107cd44a7d7b |
15 | 748e75319cb |
hex | 3d4fc8c8209 |
4213305016841 has 2 divisors, whose sum is σ = 4213305016842. Its totient is φ = 4213305016840.
The previous prime is 4213305016751. The next prime is 4213305016847. The reversal of 4213305016841 is 1486105033124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4149348630025 + 63956386816 = 2036995^2 + 252896^2 .
It is a cyclic number.
It is not a de Polignac number, because 4213305016841 - 230 = 4212231275017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4213305016795 and 4213305016804.
It is not a weakly prime, because it can be changed into another prime (4213305016847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2106652508420 + 2106652508421.
It is an arithmetic number, because the mean of its divisors is an integer number (2106652508421).
Almost surely, 24213305016841 is an apocalyptic number.
It is an amenable number.
4213305016841 is a deficient number, since it is larger than the sum of its proper divisors (1).
4213305016841 is an equidigital number, since it uses as much as digits as its factorization.
4213305016841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 4213305016841 in words is "four trillion, two hundred thirteen billion, three hundred five million, sixteen thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •