Properties of the Number 10124

Ten Thousand One Hundred Twenty-Four

Basics

Value: 10123 → 10124 → 10125

Parity: even

Prime: No

Previous Prime: 10111

Next Prime: 10133

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 2531

Divisors: 1, 2, 4, 2531, 5062, 10124

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10011110001100

Octal: 23614

Duodecimal: 5A38

Hexadecimal: 278c

Square: 102495376

Square Root: 100.61808982484213

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

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

Numbers k such that k² contains exactly 9 different digits. A54037

a(n)² is the least square to contain n different decimal digits. A54039

T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having four times any element equal to the sum of the remaining four. A249466

Generalized Fibonacci numbers. A6603

G.f.: ∑_n>=0 xⁿ * ∏_k=1..n (k + n·x) / (1 + k·x + n·x²). A204064

Numbers k such that k¹⁴ == 1 (mod 15³). A56087

Least number whose digits can be used to form exactly n different primes (not necessarily using all digits). A76449

a(n) = 5·n² - 1. A134538

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..3, with k running over the positive integers; square array, read by antidiagonals, downwards. A319061