Base | Representation |
---|---|
bin | 11111011010000… |
… | …10001100000000 |
3 | 200100202100020002 |
4 | 33231002030000 |
5 | 1014421314210 |
6 | 42050535132 |
7 | 6346255454 |
oct | 1755021400 |
9 | 610670202 |
10 | 263463680 |
11 | 12579a187 |
12 | 742974a8 |
13 | 4277798c |
14 | 26dc2664 |
15 | 181e34a5 |
hex | fb42300 |
263463680 has 72 divisors (see below), whose sum is σ = 648250512. Its totient is φ = 102518784.
The previous prime is 263463677. The next prime is 263463703. The reversal of 263463680 is 86364362.
It is a super-2 number, since 2×2634636802 = 138826221358284800, which contains 22 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 7 ways as a sum of consecutive naturals, for example, 44579 + ... + 50141.
Almost surely, 2263463680 is an apocalyptic number.
263463680 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 263463680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (324125256).
263463680 is an abundant number, since it is smaller than the sum of its proper divisors (384786832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263463680 is an equidigital number, since it uses as much as digits as its factorization.
263463680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5621 (or 5607 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 38.
The square root of 263463680 is about 16231.5643115505. The cubic root of 263463680 is about 641.0721611903.
The spelling of 263463680 in words is "two hundred sixty-three million, four hundred sixty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •