Base | Representation |
---|---|
bin | 110110010000… |
… | …110100001010 |
3 | 222202200112220 |
4 | 312100310022 |
5 | 12120142100 |
6 | 1224514510 |
7 | 231623166 |
oct | 66206412 |
9 | 28680486 |
10 | 14224650 |
11 | 8036210 |
12 | 491ba36 |
13 | 2c4076b |
14 | 1c63ca6 |
15 | 13aeaa0 |
hex | d90d0a |
14224650 has 96 divisors (see below), whose sum is σ = 39693888. Its totient is φ = 3340800.
The previous prime is 14224643. The next prime is 14224669. The reversal of 14224650 is 5642241.
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 14224650.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 60934 + ... + 61166.
It is an arithmetic number, because the mean of its divisors is an integer number (413478).
Almost surely, 214224650 is an apocalyptic number.
14224650 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 14224650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19846944).
14224650 is an abundant number, since it is smaller than the sum of its proper divisors (25469238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14224650 is a wasteful number, since it uses less digits than its factorization.
14224650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296 (or 291 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 14224650 is about 3771.5580334923. The cubic root of 14224650 is about 242.2965310672.
Adding to 14224650 its reverse (5642241), we get a palindrome (19866891).
The spelling of 14224650 in words is "fourteen million, two hundred twenty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •