Base | Representation |
---|---|
bin | 110100010001… |
… | …110000101101 |
3 | 221210020200100 |
4 | 310101300231 |
5 | 12002013422 |
6 | 1205421313 |
7 | 224325021 |
oct | 64216055 |
9 | 27706610 |
10 | 13704237 |
11 | 7810218 |
12 | 470a839 |
13 | 2aba921 |
14 | 1b6a381 |
15 | 130a7ac |
hex | d11c2d |
13704237 has 6 divisors (see below), whose sum is σ = 19795022. Its totient is φ = 9136152.
The previous prime is 13704203. The next prime is 13704241. The reversal of 13704237 is 73240731.
It can be written as a sum of positive squares in only one way, i.e., 7001316 + 6702921 = 2646^2 + 2589^2 .
It is not a de Polignac number, because 13704237 - 214 = 13687853 is a prime.
It is a super-2 number, since 2×137042372 = 375612223504338, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13704237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13704277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 761338 + ... + 761355.
Almost surely, 213704237 is an apocalyptic number.
It is an amenable number.
13704237 is a deficient number, since it is larger than the sum of its proper divisors (6090785).
13704237 is a wasteful number, since it uses less digits than its factorization.
13704237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1522699 (or 1522696 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The square root of 13704237 is about 3701.9234189810. The cubic root of 13704237 is about 239.3049159357.
Adding to 13704237 its reverse (73240731), we get a palindrome (86944968).
The spelling of 13704237 in words is "thirteen million, seven hundred four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •