Base | Representation |
---|---|
bin | 110100100111… |
… | …100101101001 |
3 | 221221210022121 |
4 | 310213211221 |
5 | 12012344031 |
6 | 1211351241 |
7 | 225146461 |
oct | 64474551 |
9 | 27853277 |
10 | 13793641 |
11 | 7871404 |
12 | 4752521 |
13 | 2b1c524 |
14 | 1b90ba1 |
15 | 1327011 |
hex | d27969 |
13793641 has 2 divisors, whose sum is σ = 13793642. Its totient is φ = 13793640.
The previous prime is 13793609. The next prime is 13793651. The reversal of 13793641 is 14639731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13660416 + 133225 = 3696^2 + 365^2 .
It is an emirp because it is prime and its reverse (14639731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13793641 - 25 = 13793609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13793597 and 13793606.
It is not a weakly prime, because it can be changed into another prime (13793651) 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 as a sum of consecutive naturals, namely, 6896820 + 6896821.
It is an arithmetic number, because the mean of its divisors is an integer number (6896821).
Almost surely, 213793641 is an apocalyptic number.
It is an amenable number.
13793641 is a deficient number, since it is larger than the sum of its proper divisors (1).
13793641 is an equidigital number, since it uses as much as digits as its factorization.
13793641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608, while the sum is 34.
The square root of 13793641 is about 3713.9791329516. The cubic root of 13793641 is about 239.8241825750.
The spelling of 13793641 in words is "thirteen million, seven hundred ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •