Base | Representation |
---|---|
bin | 11111100100001… |
… | …00110010011101 |
3 | 200110020110210211 |
4 | 33302010302131 |
5 | 1020241110203 |
6 | 42135132421 |
7 | 6363431041 |
oct | 1762046235 |
9 | 613213724 |
10 | 264785053 |
11 | 126511a25 |
12 | 74814111 |
13 | 42b1b260 |
14 | 27248021 |
15 | 183a4c6d |
hex | fc84c9d |
264785053 has 8 divisors (see below), whose sum is σ = 286971608. Its totient is φ = 242858304.
The previous prime is 264785033. The next prime is 264785111. The reversal of 264785053 is 350587462.
It can be written as a sum of positive squares in 4 ways, for example, as 7086244 + 257698809 = 2662^2 + 16053^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 264785053 - 225 = 231230621 is a prime.
It is a super-2 number, since 2×2647850532 = 140222248584425618, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 264784997 and 264785015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264785033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62826 + ... + 66907.
It is an arithmetic number, because the mean of its divisors is an integer number (35871451).
Almost surely, 2264785053 is an apocalyptic number.
It is an amenable number.
264785053 is a deficient number, since it is larger than the sum of its proper divisors (22186555).
264785053 is a wasteful number, since it uses less digits than its factorization.
264785053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129903.
The product of its (nonzero) digits is 201600, while the sum is 40.
The square root of 264785053 is about 16272.2172121687. The cubic root of 264785053 is about 642.1421166473.
The spelling of 264785053 in words is "two hundred sixty-four million, seven hundred eighty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •