Base | Representation |
---|---|
bin | 11111100001011… |
… | …00111111011110 |
3 | 200102120012111202 |
4 | 33300230333132 |
5 | 1020143103223 |
6 | 42123315502 |
7 | 6360402434 |
oct | 1760547736 |
9 | 612505452 |
10 | 264425438 |
11 | 126296822 |
12 | 7467bb92 |
13 | 42a23674 |
14 | 27192d54 |
15 | 18333428 |
hex | fc2cfde |
264425438 has 8 divisors (see below), whose sum is σ = 396727632. Its totient is φ = 132182896.
The previous prime is 264425437. The next prime is 264425461. The reversal of 264425438 is 834524462.
It is a happy number.
264425438 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2644254382 = 139841624522983688, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264425437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1370 + ... + 23037.
It is an arithmetic number, because the mean of its divisors is an integer number (49590954).
Almost surely, 2264425438 is an apocalyptic number.
264425438 is a deficient number, since it is larger than the sum of its proper divisors (132302194).
264425438 is a wasteful number, since it uses less digits than its factorization.
264425438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29826.
The product of its digits is 184320, while the sum is 38.
The square root of 264425438 is about 16261.1634885084. The cubic root of 264425438 is about 641.8512787822.
It can be divided in two parts, 2644 and 25438, that added together give a palindrome (28082).
The spelling of 264425438 in words is "two hundred sixty-four million, four hundred twenty-five thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •