Base | Representation |
---|---|
bin | 10000000011111… |
… | …000001111000001 |
3 | 200210000120222001 |
4 | 100003320033001 |
5 | 1022434432400 |
6 | 42423144001 |
7 | 6451210000 |
oct | 2003701701 |
9 | 623016861 |
10 | 269452225 |
11 | 12910a499 |
12 | 762a5001 |
13 | 43a936b3 |
14 | 27b00c37 |
15 | 189c7a6a |
hex | 100f83c1 |
269452225 has 45 divisors (see below), whose sum is σ = 395688867. Its totient is φ = 182009520.
The previous prime is 269452201. The next prime is 269452231. The reversal of 269452225 is 522254962.
The square root of 269452225 is 16415.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 97002801 + 172449424 = 9849^2 + 13132^2 .
It is not a de Polignac number, because 269452225 - 227 = 135234497 is a prime.
It is a super-3 number, since 3×2694522253 (a number of 26 digits) contains 333 as substring.
It is an unprimeable number.
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 44 ways as a sum of consecutive naturals, for example, 4021642 + ... + 4021708.
Almost surely, 2269452225 is an apocalyptic number.
269452225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
269452225 is the 16415-th square number.
269452225 is the 8208-th centered octagonal number.
It is an amenable number.
269452225 is a deficient number, since it is larger than the sum of its proper divisors (126236642).
269452225 is an frugal number, since it uses more digits than its factorization.
269452225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172 (or 79 counting only the distinct ones).
The product of its digits is 86400, while the sum is 37.
The cubic root of 269452225 is about 645.8930201745.
The spelling of 269452225 in words is "two hundred sixty-nine million, four hundred fifty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •