Base | Representation |
---|---|
bin | 110101101011… |
… | …111110010110 |
3 | 222111000120000 |
4 | 311223332112 |
5 | 12100330000 |
6 | 1221352130 |
7 | 230424225 |
oct | 65537626 |
9 | 28430500 |
10 | 14073750 |
11 | 7a428a9 |
12 | 4868646 |
13 | 2bb9b82 |
14 | 1c24cbc |
15 | 1380000 |
hex | d6bf96 |
14073750 has 100 divisors (see below), whose sum is σ = 39690420. Its totient is φ = 3726000.
The previous prime is 14073749. The next prime is 14073751. The reversal of 14073750 is 5737041.
It is an interprime number because it is at equal distance from previous prime (14073749) and next prime (14073751).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14073751) by changing a digit.
It is a polite number, since it can be written in 49 ways as a sum of consecutive naturals, for example, 101181 + ... + 101319.
Almost surely, 214073750 is an apocalyptic number.
14073750 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 14073750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19845210).
14073750 is an abundant number, since it is smaller than the sum of its proper divisors (25616670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14073750 is an equidigital number, since it uses as much as digits as its factorization.
14073750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173 (or 149 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 14073750 is about 3751.4997001199. The cubic root of 14073750 is about 241.4366949537.
The spelling of 14073750 in words is "fourteen million, seventy-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •