Base | Representation |
---|---|
bin | 11111011110000… |
… | …11011100000000 |
3 | 200101202020102210 |
4 | 33233003130000 |
5 | 1020040234323 |
6 | 42110142120 |
7 | 6353622102 |
oct | 1757033400 |
9 | 611666383 |
10 | 263993088 |
11 | 126020a07 |
12 | 744b1940 |
13 | 42901938 |
14 | 270bd572 |
15 | 1829a293 |
hex | fbc3700 |
263993088 has 72 divisors (see below), whose sum is σ = 705817728. Its totient is φ = 87596032.
The previous prime is 263993071. The next prime is 263993129. The reversal of 263993088 is 880399362.
263993088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201331 + ... + 202637.
It is an arithmetic number, because the mean of its divisors is an integer number (9803024).
Almost surely, 2263993088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 263993088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (352908864).
263993088 is an abundant number, since it is smaller than the sum of its proper divisors (441824640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263993088 is a wasteful number, since it uses less digits than its factorization.
263993088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1589 (or 1575 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 48.
The square root of 263993088 is about 16247.8641057833. The cubic root of 263993088 is about 641.5012673449.
The spelling of 263993088 in words is "two hundred sixty-three million, nine hundred ninety-three thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •