Base | Representation |
---|---|
bin | 110001010110000000… |
… | …1011000000000001001 |
3 | 101010111220022210002112 |
4 | 1202230001120000021 |
5 | 3214004101203323 |
6 | 120402455112105 |
7 | 10440626551331 |
oct | 1425401300011 |
9 | 333456283075 |
10 | 105965256713 |
11 | 40a37696828 |
12 | 18653672635 |
13 | 9cb9632544 |
14 | 51b33c80c1 |
15 | 2b52cad178 |
hex | 18ac058009 |
105965256713 has 2 divisors, whose sum is σ = 105965256714. Its totient is φ = 105965256712.
The previous prime is 105965256583. The next prime is 105965256739. The reversal of 105965256713 is 317652569501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70941257104 + 35023999609 = 266348^2 + 187147^2 .
It is an emirp because it is prime and its reverse (317652569501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105965256713 is a prime.
It is a super-2 number, since 2×1059652567132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105965256743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52982628356 + 52982628357.
It is an arithmetic number, because the mean of its divisors is an integer number (52982628357).
Almost surely, 2105965256713 is an apocalyptic number.
It is an amenable number.
105965256713 is a deficient number, since it is larger than the sum of its proper divisors (1).
105965256713 is an equidigital number, since it uses as much as digits as its factorization.
105965256713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701000, while the sum is 50.
The spelling of 105965256713 in words is "one hundred five billion, nine hundred sixty-five million, two hundred fifty-six thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •