Base | Representation |
---|---|
bin | 1000010001100011… |
… | …1111001001011101 |
3 | 12201210110201212112 |
4 | 2010120333021131 |
5 | 14022103030441 |
6 | 1004222443405 |
7 | 106020254315 |
oct | 20430771135 |
9 | 5653421775 |
10 | 2221142621 |
11 | a3a860365 |
12 | 51ba33565 |
13 | 295224b99 |
14 | 170dc2445 |
15 | ceee64eb |
hex | 8463f25d |
2221142621 has 2 divisors, whose sum is σ = 2221142622. Its totient is φ = 2221142620.
The previous prime is 2221142551. The next prime is 2221142681. The reversal of 2221142621 is 1262411222.
2221142621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2220765625 + 376996 = 47125^2 + 614^2 .
It is a cyclic number.
It is not a de Polignac number, because 2221142621 - 218 = 2220880477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2221142681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110571310 + 1110571311.
It is an arithmetic number, because the mean of its divisors is an integer number (1110571311).
Almost surely, 22221142621 is an apocalyptic number.
It is an amenable number.
2221142621 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221142621 is an equidigital number, since it uses as much as digits as its factorization.
2221142621 is an evil number, because the sum of its binary digits is even.
The product of its digits is 768, while the sum is 23.
The square root of 2221142621 is about 47128.9997878164. Note that the first 3 decimals coincide. The cubic root of 2221142621 is about 1304.7445213639.
Adding to 2221142621 its reverse (1262411222), we get a palindrome (3483553843).
The spelling of 2221142621 in words is "two billion, two hundred twenty-one million, one hundred forty-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •