Base | Representation |
---|---|
bin | 11111011101010… |
… | …10100010011000 |
3 | 200101120001112022 |
4 | 33232222202120 |
5 | 1020024003341 |
6 | 42104034012 |
7 | 6353015540 |
oct | 1756524230 |
9 | 611501468 |
10 | 263891096 |
11 | 125a61317 |
12 | 74462908 |
13 | 428973a1 |
14 | 27094320 |
15 | 18279e4b |
hex | fbaa898 |
263891096 has 64 divisors (see below), whose sum is σ = 592220160. Its totient is φ = 107856000.
The previous prime is 263891093. The next prime is 263891099. The reversal of 263891096 is 690198362.
It is an interprime number because it is at equal distance from previous prime (263891093) and next prime (263891099).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (263891093) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122186 + ... + 124326.
It is an arithmetic number, because the mean of its divisors is an integer number (9253440).
Almost surely, 2263891096 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 263891096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (296110080).
263891096 is an abundant number, since it is smaller than the sum of its proper divisors (328329064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263891096 is a wasteful number, since it uses less digits than its factorization.
263891096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2256 (or 2252 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 44.
The square root of 263891096 is about 16244.7251746528. The cubic root of 263891096 is about 641.4186434330.
The spelling of 263891096 in words is "two hundred sixty-three million, eight hundred ninety-one thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •