Base | Representation |
---|---|
bin | 110001111100… |
… | …001101100011 |
3 | 220122010102011 |
4 | 301330031203 |
5 | 11322413213 |
6 | 1144333351 |
7 | 216164113 |
oct | 61741543 |
9 | 26563364 |
10 | 13091683 |
11 | 7431a80 |
12 | 4474257 |
13 | 2934b77 |
14 | 1a4b043 |
15 | 123903d |
hex | c7c363 |
13091683 has 8 divisors (see below), whose sum is σ = 15122160. Its totient is φ = 11201280.
The previous prime is 13091677. The next prime is 13091693. The reversal of 13091683 is 38619031.
13091683 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13091683 - 221 = 10994531 is a prime.
It is a Duffinian number.
13091683 is a modest number, since divided by 1683 gives 1309 as remainder.
It is not an unprimeable number, because it can be changed into a prime (13091693) 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 7 ways as a sum of consecutive naturals, for example, 34818 + ... + 35191.
It is an arithmetic number, because the mean of its divisors is an integer number (1890270).
Almost surely, 213091683 is an apocalyptic number.
13091683 is a deficient number, since it is larger than the sum of its proper divisors (2030477).
13091683 is a wasteful number, since it uses less digits than its factorization.
13091683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70037.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 13091683 is about 3618.2430819391. The cubic root of 13091683 is about 235.6849369905.
It can be divided in two parts, 1309 and 1683, that added together give a palindrome (2992).
The spelling of 13091683 in words is "thirteen million, ninety-one thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •