Properties of the Number 75111

Seventy-Five Thousand One Hundred Eleven

Basics

Value: 75110 → 75111 → 75112

Parity: odd

Prime: No

Previous Prime: 75109

Next Prime: 75133

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 25037

Divisors: 1, 3, 25037, 75111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010010101100111

Octal: 222547

Duodecimal: 37573

Hexadecimal: 12567

Square: 5641662321

Square Root: 274.06386117107814

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

T(n,k) is the number of n X k (0,1,2) arrays of permanents of 2 X 2 subblocks of some (n+1) X (k+1) binary array. A226852

Semiprimes for which both the sum and the product of the digits is also a semiprime. A118690

Number of nX2 (0,1,2) arrays of permanents of 2X2 subblocks of some (n+1)X3 binary array. A226846

Number of nX6 (0,1,2) arrays of permanents of 2X2 subblocks of some (n+1)X7 binary array. A226850

Start with 1 and repeatedly reverse the digits and add 56 to get the next term. A118152

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5. A296812

a(n) = ∑_{i=0..floor(n/2)} (-1)^i+floor(n/2)*T(2i+e), where T(n) are tribonacci numbers (A000073) and e = (1/2)(1-(-1)ⁿ). A75111