Base | Representation |
---|---|
bin | 10011000111110101… |
… | …01011001010101101 |
3 | 222111110210001101002 |
4 | 21203322223022231 |
5 | 132011130311031 |
6 | 4414413330045 |
7 | 512256525404 |
oct | 114372531255 |
9 | 28443701332 |
10 | 10266260141 |
11 | 4399044215 |
12 | 1ba6196925 |
13 | c77c03c57 |
14 | 6d567263b |
15 | 401454ccb |
hex | 263eab2ad |
10266260141 has 2 divisors, whose sum is σ = 10266260142. Its totient is φ = 10266260140.
The previous prime is 10266260129. The next prime is 10266260161. The reversal of 10266260141 is 14106266201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9990002500 + 276257641 = 99950^2 + 16621^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10266260141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10266260161) 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 as a sum of consecutive naturals, namely, 5133130070 + 5133130071.
It is an arithmetic number, because the mean of its divisors is an integer number (5133130071).
Almost surely, 210266260141 is an apocalyptic number.
It is an amenable number.
10266260141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10266260141 is an equidigital number, since it uses as much as digits as its factorization.
10266260141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 10266260141 in words is "ten billion, two hundred sixty-six million, two hundred sixty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •