Base | Representation |
---|---|
bin | 11010010101100000… |
… | …10111111101001101 |
3 | 1100111101012112122220 |
4 | 31022300113331031 |
5 | 212424102100114 |
6 | 10255001525553 |
7 | 1010244224610 |
oct | 151260277515 |
9 | 40441175586 |
10 | 14139096909 |
11 | 5aa6173863 |
12 | 28a71a38b9 |
13 | 1444391142 |
14 | 981b64177 |
15 | 57b45c0a9 |
hex | 34ac17f4d |
14139096909 has 16 divisors (see below), whose sum is σ = 21550202880. Its totient is φ = 8077641840.
The previous prime is 14139096841. The next prime is 14139096913. The reversal of 14139096909 is 90969093141.
It is a de Polignac number, because none of the positive numbers 2k-14139096909 is a prime.
It is a super-2 number, since 2×141390969092 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14139096929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20404 + ... + 169394.
It is an arithmetic number, because the mean of its divisors is an integer number (1346887680).
Almost surely, 214139096909 is an apocalyptic number.
It is an amenable number.
14139096909 is a deficient number, since it is larger than the sum of its proper divisors (7411105971).
14139096909 is a wasteful number, since it uses less digits than its factorization.
14139096909 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153520.
The product of its (nonzero) digits is 472392, while the sum is 51.
The spelling of 14139096909 in words is "fourteen billion, one hundred thirty-nine million, ninety-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •