Base | Representation |
---|---|
bin | 10000000010111… |
… | …100001000101001 |
3 | 200202120002021201 |
4 | 100002330020221 |
5 | 1022404043212 |
6 | 42414004201 |
7 | 6446133211 |
oct | 2002741051 |
9 | 622502251 |
10 | 269206057 |
11 | 128a6154a |
12 | 761a6661 |
13 | 43a08633 |
14 | 27a79241 |
15 | 18979b57 |
hex | 100bc229 |
269206057 has 4 divisors (see below), whose sum is σ = 269606740. Its totient is φ = 268805376.
The previous prime is 269206039. The next prime is 269206081. The reversal of 269206057 is 750602962.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 183439936 + 85766121 = 13544^2 + 9261^2 .
It is a cyclic number.
It is not a de Polignac number, because 269206057 - 219 = 268681769 is a prime.
It is a super-2 number, since 2×2692060572 = 144943802250974498, which contains 22 as substring.
It is the 16408-th Hogben number.
It is a Duffinian number.
269206057 is a modest number, since divided by 6057 gives 2692 as remainder.
It is not an unprimeable number, because it can be changed into a prime (269206037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 199332 + ... + 200677.
It is an arithmetic number, because the mean of its divisors is an integer number (67401685).
Almost surely, 2269206057 is an apocalyptic number.
It is an amenable number.
269206057 is a deficient number, since it is larger than the sum of its proper divisors (400683).
269206057 is an equidigital number, since it uses as much as digits as its factorization.
269206057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400682.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 269206057 is about 16407.5000228554. The cubic root of 269206057 is about 645.6962671297.
The spelling of 269206057 in words is "two hundred sixty-nine million, two hundred six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •