Base | Representation |
---|---|
bin | 110110110001… |
… | …010111000000 |
3 | 1000000110102000 |
4 | 312301113000 |
5 | 12133423302 |
6 | 1231424000 |
7 | 233016630 |
oct | 66612700 |
9 | 30013360 |
10 | 14357952 |
11 | 8117384 |
12 | 4985000 |
13 | 2c8933b |
14 | 1c9a6c0 |
15 | 13d931c |
hex | db15c0 |
14357952 has 112 divisors (see below), whose sum is σ = 48280320. Its totient is φ = 4098816.
The previous prime is 14357947. The next prime is 14357969. The reversal of 14357952 is 25975341.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11503 + ... + 12689.
Almost surely, 214357952 is an apocalyptic number.
14357952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14357952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24140160).
14357952 is an abundant number, since it is smaller than the sum of its proper divisors (33922368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14357952 is a wasteful number, since it uses less digits than its factorization.
14357952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1215 (or 1199 counting only the distinct ones).
The product of its digits is 37800, while the sum is 36.
The square root of 14357952 is about 3789.1888313991. The cubic root of 14357952 is about 243.0510485649.
The spelling of 14357952 in words is "fourteen million, three hundred fifty-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •