Base | Representation |
---|---|
bin | 1111001011101101… |
… | …1010001111000101 |
3 | 101112001001222202212 |
4 | 3302323122033011 |
5 | 31321332111404 |
6 | 1512231313205 |
7 | 202666353224 |
oct | 36273321705 |
9 | 11461058685 |
10 | 4075660229 |
11 | 1801670943 |
12 | 958b1b805 |
13 | 4cc4c2694 |
14 | 2a940acbb |
15 | 18cc1d06e |
hex | f2eda3c5 |
4075660229 has 2 divisors, whose sum is σ = 4075660230. Its totient is φ = 4075660228.
The previous prime is 4075660201. The next prime is 4075660243. The reversal of 4075660229 is 9220665704.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3283519204 + 792141025 = 57302^2 + 28145^2 .
It is a cyclic number.
It is not a de Polignac number, because 4075660229 - 224 = 4058883013 is a prime.
It is a super-2 number, since 2×40756602292 = 33222012604504664882, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4075660429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2037830114 + 2037830115.
It is an arithmetic number, because the mean of its divisors is an integer number (2037830115).
Almost surely, 24075660229 is an apocalyptic number.
It is an amenable number.
4075660229 is a deficient number, since it is larger than the sum of its proper divisors (1).
4075660229 is an equidigital number, since it uses as much as digits as its factorization.
4075660229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 41.
The square root of 4075660229 is about 63840.8977772086. The cubic root of 4075660229 is about 1597.3471963942.
The spelling of 4075660229 in words is "four billion, seventy-five million, six hundred sixty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •