Base | Representation |
---|---|
bin | 11010100101001111… |
… | …00101100010010000 |
3 | 1100211120102110201111 |
4 | 31102213211202100 |
5 | 213211334322320 |
6 | 10320033143104 |
7 | 1013435406643 |
oct | 152247454220 |
9 | 40746373644 |
10 | 14271010960 |
11 | 6063682838 |
12 | 29233baa94 |
13 | 14657c9bab |
14 | 9954a1a5a |
15 | 587d17a5a |
hex | 3529e5890 |
14271010960 has 80 divisors (see below), whose sum is σ = 35104449600. Its totient is φ = 5380397568.
The previous prime is 14271010913. The next prime is 14271010967. The reversal of 14271010960 is 6901017241.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (14271010967) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 275611 + ... + 323269.
It is an arithmetic number, because the mean of its divisors is an integer number (438805620).
Almost surely, 214271010960 is an apocalyptic number.
14271010960 is a gapful number since it is divisible by the number (10) 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 14271010960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17552224800).
14271010960 is an abundant number, since it is smaller than the sum of its proper divisors (20833438640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14271010960 is a wasteful number, since it uses less digits than its factorization.
14271010960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47888 (or 47882 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 31.
The spelling of 14271010960 in words is "fourteen billion, two hundred seventy-one million, ten thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •