Base | Representation |
---|---|
bin | 110000111001011011… |
… | …0001001000010101101 |
3 | 101001001001100000201112 |
4 | 1201302312021002231 |
5 | 3210023014314131 |
6 | 120123351121405 |
7 | 10405101235265 |
oct | 1416266110255 |
9 | 331031300645 |
10 | 105006010541 |
11 | 405951789a3 |
12 | 18426373265 |
13 | 9b95994063 |
14 | 5121c487a5 |
15 | 2ae897c02b |
hex | 1872d890ad |
105006010541 has 2 divisors, whose sum is σ = 105006010542. Its totient is φ = 105006010540.
The previous prime is 105006010511. The next prime is 105006010559. The reversal of 105006010541 is 145010600501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104827012900 + 178997641 = 323770^2 + 13379^2 .
It is a cyclic number.
It is not a de Polignac number, because 105006010541 - 210 = 105006009517 is a prime.
It is a super-2 number, since 2×1050060105412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105006010511) 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, 52503005270 + 52503005271.
It is an arithmetic number, because the mean of its divisors is an integer number (52503005271).
Almost surely, 2105006010541 is an apocalyptic number.
It is an amenable number.
105006010541 is a deficient number, since it is larger than the sum of its proper divisors (1).
105006010541 is an equidigital number, since it uses as much as digits as its factorization.
105006010541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 23.
It can be divided in two parts, 1050060 and 10541, that added together give a palindrome (1060601).
The spelling of 105006010541 in words is "one hundred five billion, six million, ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •