Base | Representation |
---|---|
bin | 11111001001010… |
… | …10011110110101 |
3 | 200012121212021112 |
4 | 33210222132311 |
5 | 1013341110204 |
6 | 41531524405 |
7 | 6321516311 |
oct | 1744523665 |
9 | 605555245 |
10 | 261269429 |
11 | 124530653 |
12 | 735b9705 |
13 | 42189cc5 |
14 | 269b0b41 |
15 | 17e0d26e |
hex | f92a7b5 |
261269429 has 2 divisors, whose sum is σ = 261269430. Its totient is φ = 261269428.
The previous prime is 261269417. The next prime is 261269441. The reversal of 261269429 is 924962162.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (261269417) and next prime (261269441).
It can be written as a sum of positive squares in only one way, i.e., 167702500 + 93566929 = 12950^2 + 9673^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-261269429 is a prime.
It is a Sophie Germain prime.
It is a Chen 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 (261269629) 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, 130634714 + 130634715.
It is an arithmetic number, because the mean of its divisors is an integer number (130634715).
Almost surely, 2261269429 is an apocalyptic number.
It is an amenable number.
261269429 is a deficient number, since it is larger than the sum of its proper divisors (1).
261269429 is an equidigital number, since it uses as much as digits as its factorization.
261269429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 93312, while the sum is 41.
The square root of 261269429 is about 16163.8308887466. The cubic root of 261269429 is about 639.2874793337.
The spelling of 261269429 in words is "two hundred sixty-one million, two hundred sixty-nine thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •