Base | Representation |
---|---|
bin | 11111100001111… |
… | …11011000000100 |
3 | 200102201000210201 |
4 | 33300333120010 |
5 | 1020203010430 |
6 | 42125100244 |
7 | 6361135120 |
oct | 1760773004 |
9 | 612630721 |
10 | 264500740 |
11 | 126338359 |
12 | 746b7684 |
13 | 42a4ba1a |
14 | 271b2580 |
15 | 1834a8ca |
hex | fc3f604 |
264500740 has 96 divisors (see below), whose sum is σ = 662618880. Its totient is φ = 86800896.
The previous prime is 264500723. The next prime is 264500771. The reversal of 264500740 is 47005462.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 264500699 and 264500708.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 318646 + ... + 319474.
It is an arithmetic number, because the mean of its divisors is an integer number (6902280).
Almost surely, 2264500740 is an apocalyptic number.
264500740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 264500740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (331309440).
264500740 is an abundant number, since it is smaller than the sum of its proper divisors (398118140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264500740 is a wasteful number, since it uses less digits than its factorization.
264500740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941 (or 939 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 28.
The square root of 264500740 is about 16263.4787176668. The cubic root of 264500740 is about 641.9122009312.
The spelling of 264500740 in words is "two hundred sixty-four million, five hundred thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •