Base | Representation |
---|---|
bin | 100111001010… |
… | …000010011101 |
3 | 201022111120022 |
4 | 213022002131 |
5 | 10111432413 |
6 | 1004001525 |
7 | 153151223 |
oct | 47120235 |
9 | 21274508 |
10 | 10264733 |
11 | 5881056 |
12 | 35302a5 |
13 | 218520b |
14 | 1512b13 |
15 | d7b608 |
hex | 9ca09d |
10264733 has 4 divisors (see below), whose sum is σ = 10338720. Its totient is φ = 10190748.
The previous prime is 10264717. The next prime is 10264781. The reversal of 10264733 is 33746201.
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 an emirpimes, since its reverse is a distinct semiprime: 33746201 = 3067 ⋅11003.
It is a cyclic number.
It is not a de Polignac number, because 10264733 - 24 = 10264717 is a prime.
It is a super-2 number, since 2×102647332 = 210729487122578, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10264703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36785 + ... + 37062.
It is an arithmetic number, because the mean of its divisors is an integer number (2584680).
Almost surely, 210264733 is an apocalyptic number.
It is an amenable number.
10264733 is a deficient number, since it is larger than the sum of its proper divisors (73987).
10264733 is an equidigital number, since it uses as much as digits as its factorization.
10264733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73986.
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 10264733 is about 3203.8622005324. The cubic root of 10264733 is about 217.3281012850.
The spelling of 10264733 in words is "ten million, two hundred sixty-four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •