Base | Representation |
---|---|
bin | 110001000010011110… |
… | …1110110011011011011 |
3 | 101001211020101101010201 |
4 | 1202010331312123123 |
5 | 3211133331140324 |
6 | 120213451123031 |
7 | 10415452261165 |
oct | 1420475663333 |
9 | 331736341121 |
10 | 105310021339 |
11 | 40730841796 |
12 | 184b0143477 |
13 | 9c139675c3 |
14 | 5150383935 |
15 | 2b154ce444 |
hex | 1884f766db |
105310021339 has 2 divisors, whose sum is σ = 105310021340. Its totient is φ = 105310021338.
The previous prime is 105310021303. The next prime is 105310021393. The reversal of 105310021339 is 933120013501.
Together with next prime (105310021393) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105310021339 - 27 = 105310021211 is a prime.
It is a super-2 number, since 2×1053100213392 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105310028339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52655010669 + 52655010670.
It is an arithmetic number, because the mean of its divisors is an integer number (52655010670).
Almost surely, 2105310021339 is an apocalyptic number.
105310021339 is a deficient number, since it is larger than the sum of its proper divisors (1).
105310021339 is an equidigital number, since it uses as much as digits as its factorization.
105310021339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 28.
The spelling of 105310021339 in words is "one hundred five billion, three hundred ten million, twenty-one thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •