Base | Representation |
---|---|
bin | 10000000011111… |
… | …011001001001101 |
3 | 200210001012022101 |
4 | 100003323021031 |
5 | 1022440323031 |
6 | 42423315101 |
7 | 6451256512 |
oct | 2003731115 |
9 | 623035271 |
10 | 269464141 |
11 | 129118441 |
12 | 762aba91 |
13 | 43a98c4b |
14 | 27b05309 |
15 | 189cb361 |
hex | 100fb24d |
269464141 has 2 divisors, whose sum is σ = 269464142. Its totient is φ = 269464140.
The previous prime is 269464087. The next prime is 269464163. The reversal of 269464141 is 141464962.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 181010116 + 88454025 = 13454^2 + 9405^2 .
It is a cyclic number.
It is not a de Polignac number, because 269464141 - 29 = 269463629 is a prime.
It is a super-2 number, since 2×2694641412 = 145221846569735762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 269464141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (269464541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134732070 + 134732071.
It is an arithmetic number, because the mean of its divisors is an integer number (134732071).
Almost surely, 2269464141 is an apocalyptic number.
It is an amenable number.
269464141 is a deficient number, since it is larger than the sum of its proper divisors (1).
269464141 is an equidigital number, since it uses as much as digits as its factorization.
269464141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 37.
The square root of 269464141 is about 16415.3629566940. The cubic root of 269464141 is about 645.9025411546.
The spelling of 269464141 in words is "two hundred sixty-nine million, four hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •