Properties of the Number 49462

Forty-Nine Thousand Four Hundred Sixty-Two

Basics

Value: 49461 → 49462 → 49463

Parity: even

Prime: No

Previous Prime: 49459

Next Prime: 49463

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 3533

Divisors: 1, 2, 7, 14, 3533, 7066, 24731, 49462

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000100110110

Octal: 140466

Duodecimal: 2475A

Hexadecimal: c136

Square: 2446489444

Square Root: 222.4005395676908

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

List of central integer pairs in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1. A141073

Limiting row sequence for Pascal-like triangle A140995 (Stepan's triangle with index of asymmetry s = 3). A309462

Numbers k such that k and k² use only the digits 2, 4, 6, 8 and 9. A137104

Number of nXnXn 0..6 triangular arrays with each element·equal to the number its neighbors equal to 3,0,0,1,0,0,1 for x=0,1,2,3,4,5,6. A198055

Triangle G(n, k) read by rows, for 0 <= k <= n, where G(n, n) = G(n+1, 0) = 1, G(n+2, 1) = 2, G(n+3, 2) = 4, G(n+4, 3) = 8, and G(n+5, m) = G(n+1, m-3) + G(n+1, m-4) + G(n+2, m-3) + G(n+3, m-2) + G(n+4, m-1) for n >= 0 and m = 4..(n+4). A140995

a(n) is the smallest n-digit prime p such that the concatenation a(1)a(2)...a(n-1)p is prime, with a(1) = 2. A49462