Base | Representation |
---|---|
bin | 10100011110001111001101 |
3 | 101002122202220 |
4 | 110132033031 |
5 | 2333213413 |
6 | 311005553 |
7 | 63421311 |
oct | 24361715 |
9 | 11078686 |
10 | 5366733 |
11 | 3036119 |
12 | 19698b9 |
13 | 115b9a8 |
14 | 9d9b41 |
15 | 710223 |
hex | 51e3cd |
5366733 has 4 divisors (see below), whose sum is σ = 7155648. Its totient is φ = 3577820.
The previous prime is 5366729. The next prime is 5366737. The reversal of 5366733 is 3376635.
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.
It is an interprime number because it is at equal distance from previous prime (5366729) and next prime (5366737).
It is a cyclic number.
It is not a de Polignac number, because 5366733 - 22 = 5366729 is a prime.
It is a D-number.
5366733 is a lucky number.
It is a junction number, because it is equal to n+sod(n) for n = 5366694 and 5366703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5366737) 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, 894453 + ... + 894458.
It is an arithmetic number, because the mean of its divisors is an integer number (1788912).
Almost surely, 25366733 is an apocalyptic number.
It is an amenable number.
5366733 is a deficient number, since it is larger than the sum of its proper divisors (1788915).
5366733 is a wasteful number, since it uses less digits than its factorization.
5366733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1788914.
The product of its digits is 34020, while the sum is 33.
The square root of 5366733 is about 2316.6210307256. The cubic root of 5366733 is about 175.0800504517.
The spelling of 5366733 in words is "five million, three hundred sixty-six thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •