Base | Representation |
---|---|
bin | 11010100101001111… |
… | …00101100010010101 |
3 | 1100211120102110201200 |
4 | 31102213211202111 |
5 | 213211334322330 |
6 | 10320033143113 |
7 | 1013435406651 |
oct | 152247454225 |
9 | 40746373650 |
10 | 14271010965 |
11 | 6063682842 |
12 | 29233baa99 |
13 | 14657c9bb3 |
14 | 9954a1a61 |
15 | 587d17a60 |
hex | 3529e5895 |
14271010965 has 24 divisors (see below), whose sum is σ = 24925256928. Its totient is φ = 7553101920.
The previous prime is 14271010913. The next prime is 14271010967. The reversal of 14271010965 is 56901017241.
14271010965 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14271010965 - 213 = 14271002773 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14271010967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1204539 + ... + 1216328.
It is an arithmetic number, because the mean of its divisors is an integer number (1038552372).
Almost surely, 214271010965 is an apocalyptic number.
14271010965 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14271010965 is a deficient number, since it is larger than the sum of its proper divisors (10654245963).
14271010965 is a wasteful number, since it uses less digits than its factorization.
14271010965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2421009 (or 2421006 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The spelling of 14271010965 in words is "fourteen billion, two hundred seventy-one million, ten thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •