Base | Representation |
---|---|
bin | 110110011000… |
… | …100000010110 |
3 | 222211021202120 |
4 | 312120200112 |
5 | 12122144100 |
6 | 1225320410 |
7 | 232114056 |
oct | 66304026 |
9 | 28737676 |
10 | 14256150 |
11 | 8057947 |
12 | 4936106 |
13 | 2c51bbc |
14 | 1c71566 |
15 | 13b90a0 |
hex | d98816 |
14256150 has 48 divisors (see below), whose sum is σ = 35743248. Its totient is φ = 3760000.
The previous prime is 14256133. The next prime is 14256169. The reversal of 14256150 is 5165241.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14256150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14680 + ... + 15620.
It is an arithmetic number, because the mean of its divisors is an integer number (744651).
Almost surely, 214256150 is an apocalyptic number.
14256150 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 14256150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17871624).
14256150 is an abundant number, since it is smaller than the sum of its proper divisors (21487098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14256150 is a wasteful number, since it uses less digits than its factorization.
14256150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1057 (or 1052 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 14256150 is about 3775.7317171642. The cubic root of 14256150 is about 242.4752516636.
Subtracting from 14256150 its reverse (5165241), we obtain a palindrome (9090909).
The spelling of 14256150 in words is "fourteen million, two hundred fifty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •