Base | Representation |
---|---|
bin | 110011011001… |
… | …101001000000 |
3 | 221100120100200 |
4 | 303121221000 |
5 | 11422134433 |
6 | 1200445200 |
7 | 222346605 |
oct | 63315100 |
9 | 27316320 |
10 | 13474368 |
11 | 7673546 |
12 | 4619800 |
13 | 2a3a0cb |
14 | 1b0a6ac |
15 | 12b2613 |
hex | cd9a40 |
13474368 has 84 divisors (see below), whose sum is σ = 39128700. Its totient is φ = 4432896.
The previous prime is 13474339. The next prime is 13474369. The reversal of 13474368 is 86347431.
It can be written as a sum of positive squares in 2 ways, for example, as 2663424 + 10810944 = 1632^2 + 3288^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13474369) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 85746 + ... + 85902.
Almost surely, 213474368 is an apocalyptic number.
13474368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13474368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19564350).
13474368 is an abundant number, since it is smaller than the sum of its proper divisors (25654332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13474368 is a wasteful number, since it uses less digits than its factorization.
13474368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324 (or 311 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 13474368 is about 3670.7448835352. The cubic root of 13474368 is about 237.9593650467.
The spelling of 13474368 in words is "thirteen million, four hundred seventy-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •