Base | Representation |
---|---|
bin | 10000000010100… |
… | …101011100100101 |
3 | 200202101100210210 |
4 | 100002211130211 |
5 | 1022343110000 |
6 | 42412010033 |
7 | 6445265241 |
oct | 2002453445 |
9 | 622340723 |
10 | 269113125 |
11 | 1289a8746 |
12 | 76160919 |
13 | 439a5248 |
14 | 27a53421 |
15 | 1895c350 |
hex | 100a5725 |
269113125 has 20 divisors (see below), whose sum is σ = 448381472. Its totient is φ = 143526000.
The previous prime is 269113123. The next prime is 269113189. The reversal of 269113125 is 521311962.
It is not a de Polignac number, because 269113125 - 21 = 269113123 is a prime.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 269113092 and 269113101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (269113123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 69889 + ... + 73638.
Almost surely, 2269113125 is an apocalyptic number.
269113125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
269113125 is a deficient number, since it is larger than the sum of its proper divisors (179268347).
269113125 is an equidigital number, since it uses as much as digits as its factorization.
269113125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143550 (or 143535 counting only the distinct ones).
The product of its digits is 3240, while the sum is 30.
The square root of 269113125 is about 16404.6677808482. The cubic root of 269113125 is about 645.6219588070.
The spelling of 269113125 in words is "two hundred sixty-nine million, one hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •