Base | Representation |
---|---|
bin | 110001000101100011… |
… | …1100010011101111001 |
3 | 101002002102120122000002 |
4 | 1202023013202131321 |
5 | 3211341241134223 |
6 | 120232015122345 |
7 | 10421144423405 |
oct | 1421307423571 |
9 | 332072518002 |
10 | 105413224313 |
11 | 40784020701 |
12 | 1851a8133b5 |
13 | 9c2c15cc57 |
14 | 515dd6a105 |
15 | 2b1e5b7e28 |
hex | 188b1e2779 |
105413224313 has 2 divisors, whose sum is σ = 105413224314. Its totient is φ = 105413224312.
The previous prime is 105413224277. The next prime is 105413224337. The reversal of 105413224313 is 313422314501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104844497209 + 568727104 = 323797^2 + 23848^2 .
It is a cyclic number.
It is not a de Polignac number, because 105413224313 - 28 = 105413224057 is a prime.
It is a super-2 number, since 2×1054132243132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105413223313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52706612156 + 52706612157.
It is an arithmetic number, because the mean of its divisors is an integer number (52706612157).
Almost surely, 2105413224313 is an apocalyptic number.
It is an amenable number.
105413224313 is a deficient number, since it is larger than the sum of its proper divisors (1).
105413224313 is an equidigital number, since it uses as much as digits as its factorization.
105413224313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 105413224313 its reverse (313422314501), we get a palindrome (418835538814).
The spelling of 105413224313 in words is "one hundred five billion, four hundred thirteen million, two hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •