Base | Representation |
---|---|
bin | 110111010101… |
… | …011100010110 |
3 | 1000021222011000 |
4 | 313111130112 |
5 | 12203141000 |
6 | 1234524130 |
7 | 234203550 |
oct | 67253426 |
9 | 30258130 |
10 | 14505750 |
11 | 8208426 |
12 | 4a36646 |
13 | 300b6ac |
14 | 1cd84d0 |
15 | 1418000 |
hex | dd5716 |
14505750 has 128 divisors (see below), whose sum is σ = 46126080. Its totient is φ = 3304800.
The previous prime is 14505727. The next prime is 14505763. The reversal of 14505750 is 5750541.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 47097 + ... + 47403.
It is an arithmetic number, because the mean of its divisors is an integer number (360360).
Almost surely, 214505750 is an apocalyptic number.
14505750 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 14505750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23063040).
14505750 is an abundant number, since it is smaller than the sum of its proper divisors (31620330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14505750 is a wasteful number, since it uses less digits than its factorization.
14505750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340 (or 324 counting only the distinct ones).
The product of its (nonzero) digits is 3500, while the sum is 27.
The square root of 14505750 is about 3808.6414900854. The cubic root of 14505750 is about 243.8821768330.
The spelling of 14505750 in words is "fourteen million, five hundred five thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.005 sec. • engine limits •