Base | Representation |
---|---|
bin | 110110111010… |
… | …100011000110 |
3 | 1000002101001000 |
4 | 312322203012 |
5 | 12141124330 |
6 | 1232314130 |
7 | 233234436 |
oct | 66724306 |
9 | 30071030 |
10 | 14395590 |
11 | 8142690 |
12 | 49a2946 |
13 | 2ca0501 |
14 | 1caa2c6 |
15 | 13e5560 |
hex | dba8c6 |
14395590 has 128 divisors (see below), whose sum is σ = 43338240. Its totient is φ = 3369600.
The previous prime is 14395543. The next prime is 14395607. The reversal of 14395590 is 9559341.
It is a super-2 number, since 2×143955902 = 414466022896200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 109825 + ... + 109955.
It is an arithmetic number, because the mean of its divisors is an integer number (338580).
Almost surely, 214395590 is an apocalyptic number.
14395590 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 14395590, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21669120).
14395590 is an abundant number, since it is smaller than the sum of its proper divisors (28942650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14395590 is a wasteful number, since it uses less digits than its factorization.
14395590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 36.
The square root of 14395590 is about 3794.1520791871. The cubic root of 14395590 is about 243.2632416290.
The spelling of 14395590 in words is "fourteen million, three hundred ninety-five thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •