Properties of the Number 44463

Forty-Four Thousand Four Hundred Sixty-Three

Basics

Value: 44462 → 44463 → 44464

Parity: odd

Prime: No

Previous Prime: 44453

Next Prime: 44483

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 14821

Divisors: 1, 3, 14821, 44463

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1010110110101111

Octal: 126657

Duodecimal: 21893

Hexadecimal: adaf

Square: 1976958369

Square Root: 210.86251444958157

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

Similar to A374525, but for each starting matrix with a choice of whether to sort by columns or rows first, such that the total number of sorting steps for this matrix is minimized. A374526

Consecutive states of the linear congruential pseudo-random number generator 254·s mod (2¹⁶+1) when started at s=1. A384934

a(n) = a(n-1) + 4·a(n-3) + 2·a(n-4) + 2·a(n-5); a(0) = a(1) = a(2) = 1, a(3) = 5, a(4) = 11. A337492

a(n) = (∑_i=0..n-1 1/b(i)) * LCM{b(i): i=0..n-1}, where b(i) = C(i,floor(i/2)). A25553

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), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}. A149525

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)ⁿ⁺¹)ⁿ⁺¹ for n>=0. A302703

Numbers n such that string 1,0 occurs in the base 5 representation of n but not of n+1. A44463