Base | Representation |
---|---|
bin | 110011011101… |
… | …100101001001 |
3 | 221101101111100 |
4 | 303131211021 |
5 | 11423144010 |
6 | 1201052013 |
7 | 222444630 |
oct | 63354511 |
9 | 27341440 |
10 | 13490505 |
11 | 7684686 |
12 | 4627009 |
13 | 2a44562 |
14 | 1b12517 |
15 | 12b72c0 |
hex | cdd949 |
13490505 has 48 divisors (see below), whose sum is σ = 27031680. Its totient is φ = 6096384.
The previous prime is 13490479. The next prime is 13490509. The reversal of 13490505 is 50509431.
It is not a de Polignac number, because 13490505 - 27 = 13490377 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13490509) 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 47 ways as a sum of consecutive naturals, for example, 35406 + ... + 35784.
It is an arithmetic number, because the mean of its divisors is an integer number (563160).
Almost surely, 213490505 is an apocalyptic number.
13490505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13490505 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
13490505 is a wasteful number, since it uses less digits than its factorization.
13490505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510 (or 507 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 13490505 is about 3672.9422810602. The cubic root of 13490505 is about 238.0543210989.
Adding to 13490505 its reverse (50509431), we get a palindrome (63999936).
The spelling of 13490505 in words is "thirteen million, four hundred ninety thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •