Base | Representation |
---|---|
bin | 10100011101101100… |
… | …00111010110010001 |
3 | 1001100200000021022221 |
4 | 22032312013112101 |
5 | 140000020011022 |
6 | 5014102301041 |
7 | 536153403625 |
oct | 121666072621 |
9 | 31320007287 |
10 | 10986485137 |
11 | 4728647991 |
12 | 2167427781 |
13 | 10611a4ca4 |
14 | 763193185 |
15 | 4447becc7 |
hex | 28ed87591 |
10986485137 has 2 divisors, whose sum is σ = 10986485138. Its totient is φ = 10986485136.
The previous prime is 10986485131. The next prime is 10986485143. The reversal of 10986485137 is 73158468901.
10986485137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10986485131) and next prime (10986485143).
It can be written as a sum of positive squares in only one way, i.e., 10922549121 + 63936016 = 104511^2 + 7996^2 .
It is a cyclic number.
It is not a de Polignac number, because 10986485137 - 23 = 10986485129 is a prime.
It is not a weakly prime, because it can be changed into another prime (10986485131) 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 as a sum of consecutive naturals, namely, 5493242568 + 5493242569.
It is an arithmetic number, because the mean of its divisors is an integer number (5493242569).
Almost surely, 210986485137 is an apocalyptic number.
It is an amenable number.
10986485137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10986485137 is an equidigital number, since it uses as much as digits as its factorization.
10986485137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 10986485137 in words is "ten billion, nine hundred eighty-six million, four hundred eighty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •