Base | Representation |
---|---|
bin | 1111010100011111111… |
… | …1011001100000110001 |
3 | 221011100220202022221121 |
4 | 3311013333121200301 |
5 | 13303013401310321 |
6 | 320525054422241 |
7 | 25005234642301 |
oct | 3650777314061 |
9 | 834326668847 |
10 | 263200806961 |
11 | a1693aa2974 |
12 | 43015501981 |
13 | 1ba86c3b281 |
14 | ca4bacd601 |
15 | 6ca6bd4441 |
hex | 3d47fd9831 |
263200806961 has 3 divisors (see below), whose sum is σ = 263201319993. Its totient is φ = 263200293930.
The previous prime is 263200806937. The next prime is 263200806989. The reversal of 263200806961 is 169608002362.
The square root of 263200806961 is 513031.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 263200806961 - 27 = 263200806833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (263200806461) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 256516 + ... + 769546.
It is an arithmetic number, because the mean of its divisors is an integer number (87733773331).
Almost surely, 2263200806961 is an apocalyptic number.
263200806961 is the 513031-st square number.
263200806961 is the 256516-th centered octagonal number.
It is an amenable number.
263200806961 is a deficient number, since it is larger than the sum of its proper divisors (513032).
263200806961 is an frugal number, since it uses more digits than its factorization.
263200806961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1026062 (or 513031 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 43.
The spelling of 263200806961 in words is "two hundred sixty-three billion, two hundred million, eight hundred six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •