Base | Representation |
---|---|
bin | 11000010110011… |
… | …00011110010000 |
3 | 112020100112210000 |
4 | 30023030132100 |
5 | 404242330024 |
6 | 32134010000 |
7 | 5030122614 |
oct | 1413143620 |
9 | 466315700 |
10 | 204261264 |
11 | a5333569 |
12 | 584a6900 |
13 | 33419a6c |
14 | 1d1b1344 |
15 | 12debcc9 |
hex | c2cc790 |
204261264 has 75 divisors (see below), whose sum is σ = 592684257. Its totient is φ = 67915584.
The previous prime is 204261259. The next prime is 204261283. The reversal of 204261264 is 462162402.
The square root of 204261264 is 14292.
It is a perfect power (a square), and thus also a powerful number.
204261264 is a `hidden beast` number, since 2 + 0 + 42 + 612 + 6 + 4 = 666.
It can be written as a sum of positive squares in only one way, i.e., 136890000 + 67371264 = 11700^2 + 8208^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 514314 + ... + 514710.
Almost surely, 2204261264 is an apocalyptic number.
204261264 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
204261264 is the 14292-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204261264
204261264 is an abundant number, since it is smaller than the sum of its proper divisors (388422993).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204261264 is an frugal number, since it uses more digits than its factorization.
204261264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 814 (or 402 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The cubic root of 204261264 is about 588.9277316467.
The spelling of 204261264 in words is "two hundred four million, two hundred sixty-one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •