Base | Representation |
---|---|
bin | 110110010111… |
… | …001011111110 |
3 | 222211000100120 |
4 | 312113023332 |
5 | 12122011000 |
6 | 1225235410 |
7 | 232062243 |
oct | 66271376 |
9 | 28730316 |
10 | 14250750 |
11 | 8053888 |
12 | 4932b66 |
13 | 2c4c5c7 |
14 | 1c6d5ca |
15 | 13b76a0 |
hex | d972fe |
14250750 has 32 divisors (see below), whose sum is σ = 35571744. Its totient is φ = 3800000.
The previous prime is 14250749. The next prime is 14250751. The reversal of 14250750 is 5705241.
It is an interprime number because it is at equal distance from previous prime (14250749) and next prime (14250751).
It is a self number, because there is not a number n which added to its sum of digits gives 14250750.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14250751) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8751 + ... + 10250.
It is an arithmetic number, because the mean of its divisors is an integer number (1111617).
Almost surely, 214250750 is an apocalyptic number.
14250750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14250750 is an abundant number, since it is smaller than the sum of its proper divisors (21320994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14250750 is a wasteful number, since it uses less digits than its factorization.
14250750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19021 (or 19011 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 24.
The square root of 14250750 is about 3775.0165562551. The cubic root of 14250750 is about 242.4446325574. Note that the first 3 decimals are identical.
Adding to 14250750 its reverse (5705241), we get a palindrome (19955991).
The spelling of 14250750 in words is "fourteen million, two hundred fifty thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •