Base | Representation |
---|---|
bin | 110100001110… |
… | …000000000001 |
3 | 221202110112211 |
4 | 310032000001 |
5 | 12001020313 |
6 | 1205222121 |
7 | 224232064 |
oct | 64160001 |
9 | 27673484 |
10 | 13688833 |
11 | 77aa694 |
12 | 4701941 |
13 | 2ab3902 |
14 | 1b648db |
15 | 1305e3d |
hex | d0e001 |
13688833 has 4 divisors (see below), whose sum is σ = 13824468. Its totient is φ = 13553200.
The previous prime is 13688819. The next prime is 13688863. The reversal of 13688833 is 33888631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12623809 + 1065024 = 3553^2 + 1032^2 .
It is a cyclic number.
It is not a de Polignac number, because 13688833 - 221 = 11591681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13688813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67666 + ... + 67867.
It is an arithmetic number, because the mean of its divisors is an integer number (3456117).
It is a Proth number, since it is equal to 1671 ⋅ 213 + 1 and 1671 < 213.
Almost surely, 213688833 is an apocalyptic number.
It is an amenable number.
13688833 is a deficient number, since it is larger than the sum of its proper divisors (135635).
13688833 is a wasteful number, since it uses less digits than its factorization.
13688833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135634.
The product of its digits is 82944, while the sum is 40.
The square root of 13688833 is about 3699.8422939363. The cubic root of 13688833 is about 239.2152201980.
It can be divided in two parts, 1368 and 8833, that added together give a palindrome (10201).
The spelling of 13688833 in words is "thirteen million, six hundred eighty-eight thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •