Properties of the Number 48260

Forty-Eight Thousand Two Hundred Sixty

Basics

Value: 48259 → 48260 → 48261

Parity: even

Prime: No

Previous Prime: 48259

Next Prime: 48271

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 19 × 127

Divisors: 1, 2, 4, 5, 10, 19, 20, 38, 76, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011110010000100

Octal: 136204

Duodecimal: 23B18

Hexadecimal: bc84

Square: 2329027600

Square Root: 219.68158775828255

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

Number of isomorphism classes of non-associative non-commutative closed binary operations on a set of order n, listed by class size. A79194

a(n) = (2·n⁴ - 6*(-1)ⁿ*n² - 2·n² + 3*(-1)ⁿ - 3)/96. A350050

Least positive k such that k * [RSA-200]ⁿ - 1 is prime, where RSA-200 is the 200 decimal digit RSA challenge number A391940(15). A108375

Number of (n+2) X 6 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..2 introduced in row major order. A204366

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, -1, 1), (0, 0, 1), (1, 1, -1)}. A148466

a(n) = concatenation of periods of periodic sequences of ending digits of multiples of n. A211770

a(n) is the σ irregularity of the n-th power of a path graph of length at least 3·n. A363706

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..2 introduced in row major order. A204370

The sum of 2 (not necessarily distinct) abundant numbers. A48260

Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of edges in a regular n-gon after k generations of mitosis. A350502