Base | Representation |
---|---|
bin | 11010010101001101… |
… | …00000100010101101 |
3 | 1100111012100010222001 |
4 | 31022212200202231 |
5 | 212422421320022 |
6 | 10254430252301 |
7 | 1010213233504 |
oct | 151246404255 |
9 | 40435303861 |
10 | 14136510637 |
11 | 5aa4767747 |
12 | 28a6357091 |
13 | 1443996bc2 |
14 | 98168d83b |
15 | 57b0eab27 |
hex | 34a9a08ad |
14136510637 has 4 divisors (see below), whose sum is σ = 14137464316. Its totient is φ = 14135556960.
The previous prime is 14136510629. The next prime is 14136510643. The reversal of 14136510637 is 73601563141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5688327241 + 8448183396 = 75421^2 + 91914^2 .
It is a cyclic number.
It is not a de Polignac number, because 14136510637 - 23 = 14136510629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14136510596 and 14136510605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14136510137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 454248 + ... + 484369.
It is an arithmetic number, because the mean of its divisors is an integer number (3534366079).
Almost surely, 214136510637 is an apocalyptic number.
It is an amenable number.
14136510637 is a deficient number, since it is larger than the sum of its proper divisors (953679).
14136510637 is an equidigital number, since it uses as much as digits as its factorization.
14136510637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953678.
The product of its (nonzero) digits is 45360, while the sum is 37.
The spelling of 14136510637 in words is "fourteen billion, one hundred thirty-six million, five hundred ten thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •