Base | Representation |
---|---|
bin | 11000000101001011011100… |
… | …100010000110110000001011 |
3 | 111212222210122112220120122212 |
4 | 120011023130202012300023 |
5 | 102340203114344402333 |
6 | 1013125531411135335 |
7 | 31210446560236466 |
oct | 3005133442066013 |
9 | 455883575816585 |
10 | 105909003512843 |
11 | 30822835493a33 |
12 | ba65a5aba454b |
13 | 471323a0a64ab |
14 | 1c2204762c2dd |
15 | c39e09b90448 |
hex | 6052dc886c0b |
105909003512843 has 2 divisors, whose sum is σ = 105909003512844. Its totient is φ = 105909003512842.
The previous prime is 105909003512777. The next prime is 105909003512903. The reversal of 105909003512843 is 348215300909501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105909003512843 - 220 = 105909002464267 is a prime.
It is a super-2 number, since 2×1059090035128432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105909003512791 and 105909003512800.
It is not a weakly prime, because it can be changed into another prime (105909003712843) 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, 52954501756421 + 52954501756422.
It is an arithmetic number, because the mean of its divisors is an integer number (52954501756422).
Almost surely, 2105909003512843 is an apocalyptic number.
105909003512843 is a deficient number, since it is larger than the sum of its proper divisors (1).
105909003512843 is an equidigital number, since it uses as much as digits as its factorization.
105909003512843 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 105909003512843 in words is "one hundred five trillion, nine hundred nine billion, three million, five hundred twelve thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •