Base | Representation |
---|---|
bin | 110001000101111100… |
… | …1000101101010010001 |
3 | 101002010100000112211212 |
4 | 1202023321011222101 |
5 | 3211403102313041 |
6 | 120233201345505 |
7 | 10421363012666 |
oct | 1421371055221 |
9 | 332110015755 |
10 | 105426213521 |
11 | 40790392692 |
12 | 18523038295 |
13 | 9c31a5a285 |
14 | 516198ba6d |
15 | 2b207d18eb |
hex | 188be45a91 |
105426213521 has 2 divisors, whose sum is σ = 105426213522. Its totient is φ = 105426213520.
The previous prime is 105426213491. The next prime is 105426213553. The reversal of 105426213521 is 125312624501.
It is an a-pointer prime, because the next prime (105426213553) can be obtained adding 105426213521 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103748410000 + 1677803521 = 322100^2 + 40961^2 .
It is a cyclic number.
It is not a de Polignac number, because 105426213521 - 26 = 105426213457 is a prime.
It is a super-2 number, since 2×1054262135212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105426213721) 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, 52713106760 + 52713106761.
It is an arithmetic number, because the mean of its divisors is an integer number (52713106761).
Almost surely, 2105426213521 is an apocalyptic number.
It is an amenable number.
105426213521 is a deficient number, since it is larger than the sum of its proper divisors (1).
105426213521 is an equidigital number, since it uses as much as digits as its factorization.
105426213521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 105426213521 in words is "one hundred five billion, four hundred twenty-six million, two hundred thirteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •