Base | Representation |
---|---|
bin | 1111101110101000… |
… | …0100110100100101 |
3 | 101220020122110110222 |
4 | 3323222010310211 |
5 | 32121330023023 |
6 | 1534542254125 |
7 | 206425231361 |
oct | 37352046445 |
9 | 11806573428 |
10 | 4222111013 |
11 | 18772a954a |
12 | 999b87345 |
13 | 52394ac53 |
14 | 2c0a502a1 |
15 | 19a9eacc8 |
hex | fba84d25 |
4222111013 has 2 divisors, whose sum is σ = 4222111014. Its totient is φ = 4222111012.
The previous prime is 4222110953. The next prime is 4222111027. The reversal of 4222111013 is 3101112224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3640674244 + 581436769 = 60338^2 + 24113^2 .
It is a cyclic number.
It is not a de Polignac number, because 4222111013 - 220 = 4221062437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4222110982 and 4222111000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4222111513) 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, 2111055506 + 2111055507.
It is an arithmetic number, because the mean of its divisors is an integer number (2111055507).
Almost surely, 24222111013 is an apocalyptic number.
It is an amenable number.
4222111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4222111013 is an equidigital number, since it uses as much as digits as its factorization.
4222111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 4222111013 is about 64977.7732228491. The cubic root of 4222111013 is about 1616.2550048364.
Adding to 4222111013 its reverse (3101112224), we get a palindrome (7323223237).
The spelling of 4222111013 in words is "four billion, two hundred twenty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •