Base | Representation |
---|---|
bin | 110011101100… |
… | …010000000000 |
3 | 221111102220210 |
4 | 303230100000 |
5 | 11432104332 |
6 | 1202234120 |
7 | 223115046 |
oct | 63542000 |
9 | 27442823 |
10 | 13550592 |
11 | 7715840 |
12 | 4655940 |
13 | 2a65a03 |
14 | 1b2a396 |
15 | 12c9ecc |
hex | cec400 |
13550592 has 88 divisors (see below), whose sum is σ = 39498912. Its totient is φ = 4096000.
The previous prime is 13550573. The next prime is 13550597. The reversal of 13550592 is 29505531.
It is a tau number, because it is divible by the number of its divisors (88).
It is a Smith number, since the sum of its digits (30) 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 (13550597) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33592 + ... + 33992.
Almost surely, 213550592 is an apocalyptic number.
13550592 is a gapful number since it is divisible by the number (12) 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 13550592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19749456).
13550592 is an abundant number, since it is smaller than the sum of its proper divisors (25948320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13550592 is a wasteful number, since it uses less digits than its factorization.
13550592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435 (or 417 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 30.
The square root of 13550592 is about 3681.1128752050. The cubic root of 13550592 is about 238.4072306862.
The spelling of 13550592 in words is "thirteen million, five hundred fifty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •