Base | Representation |
---|---|
bin | 10000000101001… |
… | …010111101000000 |
3 | 200210122210201202 |
4 | 100011022331000 |
5 | 1023031303130 |
6 | 42434320332 |
7 | 6454120541 |
oct | 2005127500 |
9 | 623583652 |
10 | 269791040 |
11 | 129321002 |
12 | 764290a8 |
13 | 43b8198c |
14 | 27b8c4c8 |
15 | 18a43145 |
hex | 1014af40 |
269791040 has 56 divisors (see below), whose sum is σ = 649726920. Its totient is φ = 106692608.
The previous prime is 269791019. The next prime is 269791057. The reversal of 269791040 is 40197962.
It can be written as a sum of positive squares in 4 ways, for example, as 54523456 + 215267584 = 7384^2 + 14672^2 .
It is a junction number, because it is equal to n+sod(n) for n = 269790985 and 269791003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23744 + ... + 33216.
Almost surely, 2269791040 is an apocalyptic number.
269791040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 269791040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (324863460).
269791040 is an abundant number, since it is smaller than the sum of its proper divisors (379935880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
269791040 is an equidigital number, since it uses as much as digits as its factorization.
269791040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9579 (or 9569 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 38.
The square root of 269791040 is about 16425.3170441243. The cubic root of 269791040 is about 646.1636266907.
The spelling of 269791040 in words is "two hundred sixty-nine million, seven hundred ninety-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •