Base | Representation |
---|---|
bin | 110100010110… |
… | …110001011110 |
3 | 221211021211200 |
4 | 310112301132 |
5 | 12003143031 |
6 | 1210100330 |
7 | 224441616 |
oct | 64266136 |
9 | 27737750 |
10 | 13724766 |
11 | 7824690 |
12 | 471a6a6 |
13 | 2ac7083 |
14 | 1b73a46 |
15 | 13118e6 |
hex | d16c5e |
13724766 has 24 divisors (see below), whose sum is σ = 32440824. Its totient is φ = 4158960.
The previous prime is 13724761. The next prime is 13724771. The reversal of 13724766 is 66742731.
It is an interprime number because it is at equal distance from previous prime (13724761) and next prime (13724771).
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13724766.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13724761) 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 11 ways as a sum of consecutive naturals, for example, 34461 + ... + 34856.
It is an arithmetic number, because the mean of its divisors is an integer number (1351701).
Almost surely, 213724766 is an apocalyptic number.
13724766 is an abundant number, since it is smaller than the sum of its proper divisors (18716058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13724766 is a wasteful number, since it uses less digits than its factorization.
13724766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69336 (or 69333 counting only the distinct ones).
The product of its digits is 42336, while the sum is 36.
The square root of 13724766 is about 3704.6951291571. The cubic root of 13724766 is about 239.4243495479.
The spelling of 13724766 in words is "thirteen million, seven hundred twenty-four thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •