Base | Representation |
---|---|
bin | 11111100000011… |
… | …10011110010001 |
3 | 200102022212000221 |
4 | 33300032132101 |
5 | 1020130103213 |
6 | 42120513041 |
7 | 6356342125 |
oct | 1760163621 |
9 | 612285027 |
10 | 264300433 |
11 | 126210911 |
12 | 7461b781 |
13 | 429ab7b7 |
14 | 2715d585 |
15 | 1830b38d |
hex | fc0e791 |
264300433 has 4 divisors (see below), whose sum is σ = 264333888. Its totient is φ = 264266980.
The previous prime is 264300409. The next prime is 264300437. The reversal of 264300433 is 334003462.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 264300433 - 25 = 264300401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 264300398 and 264300407.
It is not an unprimeable number, because it can be changed into a prime (264300437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2460 + ... + 23122.
It is an arithmetic number, because the mean of its divisors is an integer number (66083472).
Almost surely, 2264300433 is an apocalyptic number.
It is an amenable number.
264300433 is a deficient number, since it is larger than the sum of its proper divisors (33455).
264300433 is a wasteful number, since it uses less digits than its factorization.
264300433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33454.
The product of its (nonzero) digits is 5184, while the sum is 25.
The square root of 264300433 is about 16257.3193669805. The cubic root of 264300433 is about 641.7501194958.
Adding to 264300433 its reverse (334003462), we get a palindrome (598303895).
The spelling of 264300433 in words is "two hundred sixty-four million, three hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •