Base | Representation |
---|---|
bin | 11111011010000… |
… | …10010010010001 |
3 | 200100202100202221 |
4 | 33231002102101 |
5 | 1014421322311 |
6 | 42050541041 |
7 | 6346256566 |
oct | 1755022221 |
9 | 610670687 |
10 | 263464081 |
11 | 12579a511 |
12 | 74297781 |
13 | 42777c0a |
14 | 26dc286d |
15 | 181e3671 |
hex | fb42491 |
263464081 has 4 divisors (see below), whose sum is σ = 267073252. Its totient is φ = 259854912.
The previous prime is 263464039. The next prime is 263464109. The reversal of 263464081 is 180464362.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 109307025 + 154157056 = 10455^2 + 12416^2 .
It is a cyclic number.
It is not a de Polignac number, because 263464081 - 27 = 263463953 is a prime.
It is a super-2 number, since 2×2634640812 = 138826643954349122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (263464001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1804476 + ... + 1804621.
It is an arithmetic number, because the mean of its divisors is an integer number (66768313).
Almost surely, 2263464081 is an apocalyptic number.
It is an amenable number.
263464081 is a deficient number, since it is larger than the sum of its proper divisors (3609171).
263464081 is an equidigital number, since it uses as much as digits as its factorization.
263464081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3609170.
The product of its (nonzero) digits is 27648, while the sum is 34.
The square root of 263464081 is about 16231.5766640213. The cubic root of 263464081 is about 641.0724864341.
The spelling of 263464081 in words is "two hundred sixty-three million, four hundred sixty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •