Base | Representation |
---|---|
bin | 110011011101… |
… | …100101010001 |
3 | 221101101111122 |
4 | 303131211101 |
5 | 11423144023 |
6 | 1201052025 |
7 | 222444641 |
oct | 63354521 |
9 | 27341448 |
10 | 13490513 |
11 | 7684693 |
12 | 4627015 |
13 | 2a4456a |
14 | 1b12521 |
15 | 12b72c8 |
hex | cdd951 |
13490513 has 4 divisors (see below), whose sum is σ = 14200560. Its totient is φ = 12780468.
The previous prime is 13490509. The next prime is 13490573. The reversal of 13490513 is 31509431.
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.
It is a cyclic number.
It is not a de Polignac number, because 13490513 - 22 = 13490509 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13490573) 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, 354995 + ... + 355032.
It is an arithmetic number, because the mean of its divisors is an integer number (3550140).
Almost surely, 213490513 is an apocalyptic number.
It is an amenable number.
13490513 is a deficient number, since it is larger than the sum of its proper divisors (710047).
13490513 is an equidigital number, since it uses as much as digits as its factorization.
13490513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710046.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 13490513 is about 3672.9433701052. The cubic root of 13490513 is about 238.0543681551.
Adding to 13490513 its reverse (31509431), we get a palindrome (44999944).
The spelling of 13490513 in words is "thirteen million, four hundred ninety thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •