Base | Representation |
---|---|
bin | 110011011000… |
… | …010110110000 |
3 | 221100022010201 |
4 | 303120112300 |
5 | 11422002404 |
6 | 1200404544 |
7 | 222325345 |
oct | 63302660 |
9 | 27308121 |
10 | 13469104 |
11 | 766a5a0 |
12 | 4616754 |
13 | 2a378ac |
14 | 1b087cc |
15 | 12b0ca4 |
hex | cd85b0 |
13469104 has 40 divisors (see below), whose sum is σ = 28783872. Its totient is φ = 6054720.
The previous prime is 13469101. The next prime is 13469107. The reversal of 13469104 is 40196431.
It is an interprime number because it is at equal distance from previous prime (13469101) and next prime (13469107).
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (13469101) 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 7 ways as a sum of consecutive naturals, for example, 17757 + ... + 18499.
Almost surely, 213469104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13469104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14391936).
13469104 is an abundant number, since it is smaller than the sum of its proper divisors (15314768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13469104 is a wasteful number, since it uses less digits than its factorization.
13469104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 865 (or 859 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 13469104 is about 3670.0277928103. The cubic root of 13469104 is about 237.9283733333.
The spelling of 13469104 in words is "thirteen million, four hundred sixty-nine thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •