Base | Representation |
---|---|
bin | 110100101000… |
… | …010111100001 |
3 | 221221221200211 |
4 | 310220113201 |
5 | 12012444313 |
6 | 1211414121 |
7 | 225162001 |
oct | 64502741 |
9 | 27857624 |
10 | 13796833 |
11 | 7873846 |
12 | 4754341 |
13 | 2b20b0b |
14 | 1b92001 |
15 | 1327e3d |
hex | d285e1 |
13796833 has 4 divisors (see below), whose sum is σ = 13857840. Its totient is φ = 13735828.
The previous prime is 13796821. The next prime is 13796863. The reversal of 13796833 is 33869731.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13796833 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13796863) 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, 30163 + ... + 30616.
It is an arithmetic number, because the mean of its divisors is an integer number (3464460).
Almost surely, 213796833 is an apocalyptic number.
It is an amenable number.
13796833 is a deficient number, since it is larger than the sum of its proper divisors (61007).
13796833 is an equidigital number, since it uses as much as digits as its factorization.
13796833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61006.
The product of its digits is 81648, while the sum is 40.
The square root of 13796833 is about 3714.4088358715. The cubic root of 13796833 is about 239.8426804647.
The spelling of 13796833 in words is "thirteen million, seven hundred ninety-six thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •