Base | Representation |
---|---|
bin | 110011101001… |
… | …111000110001 |
3 | 221110221122022 |
4 | 303221320301 |
5 | 11431302123 |
6 | 1202121225 |
7 | 223044611 |
oct | 63517061 |
9 | 27427568 |
10 | 13540913 |
11 | 7709541 |
12 | 4650215 |
13 | 2a61499 |
14 | 1b26a41 |
15 | 12c71c8 |
hex | ce9e31 |
13540913 has 4 divisors (see below), whose sum is σ = 13770480. Its totient is φ = 13311348.
The previous prime is 13540897. The next prime is 13540931. The reversal of 13540913 is 31904531.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31904531 = 139 ⋅229529.
It is a cyclic number.
It is not a de Polignac number, because 13540913 - 24 = 13540897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13540973) 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, 114695 + ... + 114812.
It is an arithmetic number, because the mean of its divisors is an integer number (3442620).
Almost surely, 213540913 is an apocalyptic number.
It is an amenable number.
13540913 is a deficient number, since it is larger than the sum of its proper divisors (229567).
13540913 is an equidigital number, since it uses as much as digits as its factorization.
13540913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229566.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 13540913 is about 3679.7979564101. The cubic root of 13540913 is about 238.3504535058.
It can be divided in two parts, 135 and 40913, that multiplied together give a palindrome (5523255).
The spelling of 13540913 in words is "thirteen million, five hundred forty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •