Properties of the Number 75114

Seventy-Five Thousand One Hundred Fourteen

Basics

Value: 75113 → 75114 → 75115

Parity: even

Prime: No

Previous Prime: 75109

Next Prime: 75133

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 13 × 107

Divisors: 1, 2, 3, 6, 9, 13, 18, 26, 27, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010010101101010

Octal: 222552

Duodecimal: 37576

Hexadecimal: 1256a

Square: 5642112996

Square Root: 274.0693342933499

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

The Wiener index of the P₃ X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph. A180569

The number of tiles inside a regular n-gon created by diagonals that run from each of the n vertices to the n-2 midpoints of opposite edges. A320422

a(n) = Fibonacci(n+1) + prime(n). A4398

a(n) = round(n*φ¹⁸), where φ is the golden ratio, A001622. A4953

a(n) = ceiling(n*φ¹⁸), where φ is the golden ratio, A001622. A4973

Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 8. A207099

Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its two previous neighbors modulo (n+1). A207104

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1). A207100

Perfect powers k such that 2·k + 1 is a perfect power; the value of y^b in the solution of the Diophantine equation x^a - 2y^b = 1. A75114