Base | Representation |
---|---|
bin | 110001001000100010… |
… | …0001100010101101101 |
3 | 101002100101100021222022 |
4 | 1202101010030111231 |
5 | 3212042312314131 |
6 | 120245541555525 |
7 | 10423465535351 |
oct | 1422104142555 |
9 | 332311307868 |
10 | 105513010541 |
11 | 40825386564 |
12 | 18548115ba5 |
13 | 9c46a2a363 |
14 | 516d303461 |
15 | 2b2822937b |
hex | 189110c56d |
105513010541 has 2 divisors, whose sum is σ = 105513010542. Its totient is φ = 105513010540.
The previous prime is 105513010489. The next prime is 105513010571. The reversal of 105513010541 is 145010315501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65019900100 + 40493110441 = 254990^2 + 201229^2 .
It is an emirp because it is prime and its reverse (145010315501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105513010541 - 226 = 105445901677 is a prime.
It is a super-2 number, since 2×1055130105412 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105513010541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105513010571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52756505270 + 52756505271.
It is an arithmetic number, because the mean of its divisors is an integer number (52756505271).
Almost surely, 2105513010541 is an apocalyptic number.
It is an amenable number.
105513010541 is a deficient number, since it is larger than the sum of its proper divisors (1).
105513010541 is an equidigital number, since it uses as much as digits as its factorization.
105513010541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
The spelling of 105513010541 in words is "one hundred five billion, five hundred thirteen million, ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •