Base | Representation |
---|---|
bin | 1111011000101100… |
… | …1010100100011101 |
3 | 101122211112221021222 |
4 | 3312023022210131 |
5 | 31424302401023 |
6 | 1521454503125 |
7 | 204230313023 |
oct | 36613124435 |
9 | 11584487258 |
10 | 4130122013 |
11 | 182a389886 |
12 | 973204aa5 |
13 | 50a8808a4 |
14 | 2b2746713 |
15 | 1928c9cc8 |
hex | f62ca91d |
4130122013 has 2 divisors, whose sum is σ = 4130122014. Its totient is φ = 4130122012.
The previous prime is 4130121959. The next prime is 4130122027. The reversal of 4130122013 is 3102210314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2083283449 + 2046838564 = 45643^2 + 45242^2 .
It is a cyclic number.
It is not a de Polignac number, because 4130122013 - 216 = 4130056477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4130121982 and 4130122000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4130122063) 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, 2065061006 + 2065061007.
It is an arithmetic number, because the mean of its divisors is an integer number (2065061007).
Almost surely, 24130122013 is an apocalyptic number.
It is an amenable number.
4130122013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4130122013 is an equidigital number, since it uses as much as digits as its factorization.
4130122013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 4130122013 is about 64266.0253399882. The cubic root of 4130122013 is about 1604.4306897351.
Adding to 4130122013 its reverse (3102210314), we get a palindrome (7232332327).
The spelling of 4130122013 in words is "four billion, one hundred thirty million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •