Base | Representation |
---|---|
bin | 11111100010001… |
… | …00010011011000 |
3 | 200102202001111010 |
4 | 33301010103120 |
5 | 1020204132140 |
6 | 42125333520 |
7 | 6361251006 |
oct | 1761042330 |
9 | 612661433 |
10 | 264520920 |
11 | 126351534 |
12 | 747072a0 |
13 | 42a57c71 |
14 | 271b9a76 |
15 | 18351880 |
hex | fc444d8 |
264520920 has 32 divisors (see below), whose sum is σ = 793563120. Its totient is φ = 70538880.
The previous prime is 264520913. The next prime is 264520951. The reversal of 264520920 is 29025462.
It is a super-4 number, since 4×2645209204 (a number of 35 digits) contains 4444 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1102051 + ... + 1102290.
Almost surely, 2264520920 is an apocalyptic number.
264520920 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
264520920 is an abundant number, since it is smaller than the sum of its proper divisors (529042200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264520920 is a wasteful number, since it uses less digits than its factorization.
264520920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2204355 (or 2204351 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 264520920 is about 16264.0991143069. The cubic root of 264520920 is about 641.9285253452.
The spelling of 264520920 in words is "two hundred sixty-four million, five hundred twenty thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •