Base | Representation |
---|---|
bin | 1111110000000001… |
… | …1010000101000001 |
3 | 101220122122212222112 |
4 | 3330000122011001 |
5 | 32124324341444 |
6 | 1535311545105 |
7 | 206526053204 |
oct | 37400320501 |
9 | 11818585875 |
10 | 4227965249 |
11 | 187a637962 |
12 | 99bb2b195 |
13 | 524c1a7b1 |
14 | 2c173593b |
15 | 19b2a569e |
hex | fc01a141 |
4227965249 has 2 divisors, whose sum is σ = 4227965250. Its totient is φ = 4227965248.
The previous prime is 4227965227. The next prime is 4227965251. The reversal of 4227965249 is 9425697224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4202280625 + 25684624 = 64825^2 + 5068^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4227965249 is a prime.
It is a super-3 number, since 3×42279652493 (a number of 30 digits) contains 333 as substring.
Together with 4227965251, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4227965197 and 4227965206.
It is not a weakly prime, because it can be changed into another prime (4227965549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2113982624 + 2113982625.
It is an arithmetic number, because the mean of its divisors is an integer number (2113982625).
Almost surely, 24227965249 is an apocalyptic number.
It is an amenable number.
4227965249 is a deficient number, since it is larger than the sum of its proper divisors (1).
4227965249 is an equidigital number, since it uses as much as digits as its factorization.
4227965249 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2177280, while the sum is 50.
The square root of 4227965249 is about 65022.8056069561. The cubic root of 4227965249 is about 1617.0016746397.
The spelling of 4227965249 in words is "four billion, two hundred twenty-seven million, nine hundred sixty-five thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •