Base | Representation |
---|---|
bin | 10011101000100110… |
… | …00011011101001101 |
3 | 1000012121220200022122 |
4 | 21310103003131031 |
5 | 133042004232131 |
6 | 4501552022325 |
7 | 522134520506 |
oct | 116423033515 |
9 | 30177820278 |
10 | 10541086541 |
11 | 451a194377 |
12 | 20622319a5 |
13 | cbcb2981b |
14 | 71dd71bad |
15 | 41a63ed7b |
hex | 2744c374d |
10541086541 has 2 divisors, whose sum is σ = 10541086542. Its totient is φ = 10541086540.
The previous prime is 10541086531. The next prime is 10541086579. The reversal of 10541086541 is 14568014501.
10541086541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9068752900 + 1472333641 = 95230^2 + 38371^2 .
It is a cyclic number.
It is not a de Polignac number, because 10541086541 - 210 = 10541085517 is a prime.
It is a super-2 number, since 2×105410865412 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10541086531) 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, 5270543270 + 5270543271.
It is an arithmetic number, because the mean of its divisors is an integer number (5270543271).
Almost surely, 210541086541 is an apocalyptic number.
It is an amenable number.
10541086541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10541086541 is an equidigital number, since it uses as much as digits as its factorization.
10541086541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 35.
The spelling of 10541086541 in words is "ten billion, five hundred forty-one million, eighty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •