Base | Representation |
---|---|
bin | 110110000001… |
… | …000000000000 |
3 | 222122101200201 |
4 | 312001000000 |
5 | 12111103442 |
6 | 1223254544 |
7 | 231233266 |
oct | 66010000 |
9 | 28571621 |
10 | 14159872 |
11 | 7aa1581 |
12 | 48aa454 |
13 | 2c1a12c |
14 | 1c48436 |
15 | 139a7b7 |
hex | d81000 |
14159872 has 26 divisors (see below), whose sum is σ = 28324478. Its totient is φ = 7077888.
The previous prime is 14159867. The next prime is 14159879. The reversal of 14159872 is 27895141.
It can be written as a sum of positive squares in only one way, i.e., 7929856 + 6230016 = 2816^2 + 2496^2 .
It is a nialpdrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (14159879) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2368 + ... + 5824.
It is an arithmetic number, because the mean of its divisors is an integer number (1089403).
Almost surely, 214159872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14159872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14162239).
14159872 is an abundant number, since it is smaller than the sum of its proper divisors (14164606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14159872 is an frugal number, since it uses more digits than its factorization.
14159872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3481 (or 3459 counting only the distinct ones).
The product of its digits is 20160, while the sum is 37.
The square root of 14159872 is about 3762.9605365988. The cubic root of 14159872 is about 241.9281712011.
The spelling of 14159872 in words is "fourteen million, one hundred fifty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •