Properties of the Number 50005

Fifty Thousand Five

Basics

Value: 50004 → 50005 → 50006

Parity: odd

Prime: No

Previous Prime: 49999

Next Prime: 50021

Digit Sum: 10

Digital Root: 1

Palindrome: Yes

Factorization: 5 × 73 × 137

Divisors: 1, 5, 73, 137, 365, 685, 10001, 50005

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001101010101

Octal: 141525

Duodecimal: 24B31

Hexadecimal: c355

Square: 2500500025

Square Root: 223.61797781037194

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

Numbers whose decimal expansion contains only 0's and 5's. A169964

a(n) = A069537(n)/2. A88404

Numbers k such that k | 10^k + 10. A15902

Numbers that are palindromic and divisible by 5. A43040

Number of rooted trees with n nodes with every leaf at height 3. A48808

a(n) = A063997(n)/4. A88406

Consider a decimal number of k >= 2 digits m = d_k*10^k-1 + d_k-1*10^k-2 + ... + d₂*10 + d₁. a(n) is the least number m such that the n-th iteration of the transform T(m) -> (d_k + d_k-1 mod 10)*10^k-1 + (d_k-1 + d_k-2 mod 10)*10^k-2 + ... + (d₂ + d₁ mod 10)*10 + (d₁ + d(k) mod 10) returns m, or -1 if no such number exists. A243993

a(n) = (n/2)*(n⁴ + 1). A21003

Numbers consisting of either 2's and 0's or 5's and 0's. A168541

Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists. A84013