Base | Representation |
---|---|
bin | 110100011111… |
… | …100001110001 |
3 | 221220010000210 |
4 | 310133201301 |
5 | 12010320000 |
6 | 1210534333 |
7 | 224651304 |
oct | 64374161 |
9 | 27803023 |
10 | 13760625 |
11 | 784961a |
12 | 47373a9 |
13 | 2b0a4a8 |
14 | 1b82b3b |
15 | 131c350 |
hex | d1f871 |
13760625 has 40 divisors (see below), whose sum is σ = 23617440. Its totient is φ = 7120000.
The previous prime is 13760611. The next prime is 13760627. The reversal of 13760625 is 52606731.
It is not a de Polignac number, because 13760625 - 29 = 13760113 is a prime.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13760592 and 13760601.
It is not an unprimeable number, because it can be changed into a prime (13760627) 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 39 ways as a sum of consecutive naturals, for example, 76786 + ... + 76964.
It is an arithmetic number, because the mean of its divisors is an integer number (590436).
Almost surely, 213760625 is an apocalyptic number.
13760625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13760625 is a deficient number, since it is larger than the sum of its proper divisors (9856815).
13760625 is an equidigital number, since it uses as much as digits as its factorization.
13760625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243 (or 228 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
The square root of 13760625 is about 3709.5316415957. The cubic root of 13760625 is about 239.6326846455.
The spelling of 13760625 in words is "thirteen million, seven hundred sixty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •