Base | Representation |
---|---|
bin | 110101111000… |
… | …100101010000 |
3 | 222120122101200 |
4 | 311320211100 |
5 | 12104003032 |
6 | 1222431200 |
7 | 231030621 |
oct | 65704520 |
9 | 28518350 |
10 | 14125392 |
11 | 7a78686 |
12 | 4892500 |
13 | 2c07528 |
14 | 1c39a48 |
15 | 139047c |
hex | d78950 |
14125392 has 60 divisors (see below), whose sum is σ = 39795444. Its totient is φ = 4677120.
The previous prime is 14125387. The next prime is 14125393. The reversal of 14125392 is 29352141.
It can be written as a sum of positive squares in 2 ways, for example, as 992016 + 13133376 = 996^2 + 3624^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14125393) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 33342 + ... + 33762.
Almost surely, 214125392 is an apocalyptic number.
14125392 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 14125392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19897722).
14125392 is an abundant number, since it is smaller than the sum of its proper divisors (25670052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14125392 is a wasteful number, since it uses less digits than its factorization.
14125392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668 (or 659 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
The square root of 14125392 is about 3758.3762451357. The cubic root of 14125392 is about 241.7316425102.
The spelling of 14125392 in words is "fourteen million, one hundred twenty-five thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •