Base | Representation |
---|---|
bin | 110001000010100100… |
… | …1110000101101001111 |
3 | 101001211110021000010011 |
4 | 1202011021300231033 |
5 | 3211140131044011 |
6 | 120214042054051 |
7 | 10415520644113 |
oct | 1420511605517 |
9 | 331743230104 |
10 | 105313143631 |
11 | 407325845a3 |
12 | 184b11aa327 |
13 | 9c144bb807 |
14 | 5150957743 |
15 | 2b158e9621 |
hex | 1885270b4f |
105313143631 has 2 divisors, whose sum is σ = 105313143632. Its totient is φ = 105313143630.
The previous prime is 105313143599. The next prime is 105313143641. The reversal of 105313143631 is 136341313501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105313143631 - 25 = 105313143599 is a prime.
It is a super-2 number, since 2×1053131436312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105313143593 and 105313143602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105313143641) 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, 52656571815 + 52656571816.
It is an arithmetic number, because the mean of its divisors is an integer number (52656571816).
Almost surely, 2105313143631 is an apocalyptic number.
105313143631 is a deficient number, since it is larger than the sum of its proper divisors (1).
105313143631 is an equidigital number, since it uses as much as digits as its factorization.
105313143631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
The spelling of 105313143631 in words is "one hundred five billion, three hundred thirteen million, one hundred forty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •