Base | Representation |
---|---|
bin | 110011010101… |
… | …000110000110 |
3 | 221022121211010 |
4 | 303111012012 |
5 | 11421041000 |
6 | 1200223050 |
7 | 222241410 |
oct | 63250606 |
9 | 27277733 |
10 | 13455750 |
11 | 7660560 |
12 | 460aa86 |
13 | 2a317a9 |
14 | 1b039b0 |
15 | 12abd50 |
hex | cd5186 |
13455750 has 128 divisors (see below), whose sum is σ = 42052608. Its totient is φ = 2784000.
The previous prime is 13455737. The next prime is 13455769. The reversal of 13455750 is 5755431.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 57634 + ... + 57866.
It is an arithmetic number, because the mean of its divisors is an integer number (328536).
Almost surely, 213455750 is an apocalyptic number.
13455750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13455750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21026304).
13455750 is an abundant number, since it is smaller than the sum of its proper divisors (28596858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13455750 is a wasteful number, since it uses less digits than its factorization.
13455750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 30.
The square root of 13455750 is about 3668.2080093692. The cubic root of 13455750 is about 237.8497156358.
The spelling of 13455750 in words is "thirteen million, four hundred fifty-five thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •