Base | Representation |
---|---|
bin | 110011111011… |
… | …100111011011 |
3 | 221121122020212 |
4 | 303323213123 |
5 | 11441113111 |
6 | 1203441335 |
7 | 223466411 |
oct | 63734733 |
9 | 27548225 |
10 | 13613531 |
11 | 7759058 |
12 | 468624b |
13 | 2a88559 |
14 | 1b452b1 |
15 | 12dd98b |
hex | cfb9db |
13613531 has 2 divisors, whose sum is σ = 13613532. Its totient is φ = 13613530.
The previous prime is 13613513. The next prime is 13613533. The reversal of 13613531 is 13531631.
It is a happy number.
Together with previous prime (13613513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13613531 - 210 = 13612507 is a prime.
It is a super-2 number, since 2×136135312 = 370656452575922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 13613533, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13613497 and 13613506.
It is not a weakly prime, because it can be changed into another prime (13613533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6806765 + 6806766.
It is an arithmetic number, because the mean of its divisors is an integer number (6806766).
Almost surely, 213613531 is an apocalyptic number.
13613531 is a deficient number, since it is larger than the sum of its proper divisors (1).
13613531 is an equidigital number, since it uses as much as digits as its factorization.
13613531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810, while the sum is 23.
The square root of 13613531 is about 3689.6518805980. The cubic root of 13613531 is about 238.7757740145.
The spelling of 13613531 in words is "thirteen million, six hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •