Base | Representation |
---|---|
bin | 101111110111010100110101… |
… | …100001110001110100111101 |
3 | 1000121100120102220200202021101 |
4 | 233313110311201301310331 |
5 | 210042444221303014031 |
6 | 2023415004013333101 |
7 | 62224566160341106 |
oct | 5767246541616475 |
9 | 1017316386622241 |
10 | 210510130126141 |
11 | 6109093251753a |
12 | 1b73a334797191 |
13 | 90600351b3641 |
14 | 39daa5d4cd3ad |
15 | 1950cb9129361 |
hex | bf7535871d3d |
210510130126141 has 2 divisors, whose sum is σ = 210510130126142. Its totient is φ = 210510130126140.
The previous prime is 210510130126111. The next prime is 210510130126187. The reversal of 210510130126141 is 141621031015012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132907949302041 + 77602180824100 = 11528571^2 + 8809210^2 .
It is a cyclic number.
It is not a de Polignac number, because 210510130126141 - 223 = 210510121737533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210510130126111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105255065063070 + 105255065063071.
It is an arithmetic number, because the mean of its divisors is an integer number (105255065063071).
Almost surely, 2210510130126141 is an apocalyptic number.
It is an amenable number.
210510130126141 is a deficient number, since it is larger than the sum of its proper divisors (1).
210510130126141 is an equidigital number, since it uses as much as digits as its factorization.
210510130126141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 28.
The spelling of 210510130126141 in words is "two hundred ten trillion, five hundred ten billion, one hundred thirty million, one hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •