Base | Representation |
---|---|
bin | 1111111000001001… |
… | …1001101001101101 |
3 | 102000000210011210121 |
4 | 3332002121221231 |
5 | 32212040322341 |
6 | 1542530204541 |
7 | 210421522033 |
oct | 37602315155 |
9 | 12000704717 |
10 | 4262042221 |
11 | 18978a2448 |
12 | 9ab423751 |
13 | 52bcbc398 |
14 | 2c6086553 |
15 | 19e2874d1 |
hex | fe099a6d |
4262042221 has 2 divisors, whose sum is σ = 4262042222. Its totient is φ = 4262042220.
The previous prime is 4262042219. The next prime is 4262042233. The reversal of 4262042221 is 1222402624.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3213189225 + 1048852996 = 56685^2 + 32386^2 .
It is a cyclic number.
It is not a de Polignac number, because 4262042221 - 21 = 4262042219 is a prime.
It is a super-2 number, since 2×42620422212 = 36330007787173225682, which contains 22 as substring.
Together with 4262042219, 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 (4262042201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2131021110 + 2131021111.
It is an arithmetic number, because the mean of its divisors is an integer number (2131021111).
Almost surely, 24262042221 is an apocalyptic number.
It is an amenable number.
4262042221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4262042221 is an equidigital number, since it uses as much as digits as its factorization.
4262042221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 25.
The square root of 4262042221 is about 65284.3183390927. The cubic root of 4262042221 is about 1621.3343450576.
Adding to 4262042221 its reverse (1222402624), we get a palindrome (5484444845).
The spelling of 4262042221 in words is "four billion, two hundred sixty-two million, forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •