Base | Representation |
---|---|
bin | 110101011001… |
… | …110000011000 |
3 | 222100020012020 |
4 | 311121300120 |
5 | 12040433003 |
6 | 1220014440 |
7 | 226663533 |
oct | 65316030 |
9 | 28306166 |
10 | 13999128 |
11 | 79a1830 |
12 | 4831420 |
13 | 2b91c10 |
14 | 1c05a1a |
15 | 1367d53 |
hex | d59c18 |
13999128 has 64 divisors (see below), whose sum is σ = 41126400. Its totient is φ = 3914880.
The previous prime is 13999121. The next prime is 13999133. The reversal of 13999128 is 82199931.
It is a self number, because there is not a number n which added to its sum of digits gives 13999128.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13999121) 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 15 ways as a sum of consecutive naturals, for example, 1393 + ... + 5471.
It is an arithmetic number, because the mean of its divisors is an integer number (642600).
Almost surely, 213999128 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 13999128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20563200).
13999128 is an abundant number, since it is smaller than the sum of its proper divisors (27127272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13999128 is a wasteful number, since it uses less digits than its factorization.
13999128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4112 (or 4108 counting only the distinct ones).
The product of its digits is 34992, while the sum is 42.
The square root of 13999128 is about 3741.5408590579. The cubic root of 13999128 is about 241.0092223992.
The spelling of 13999128 in words is "thirteen million, nine hundred ninety-nine thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •