Properties of the Number 46067

Forty-Six Thousand Sixty-Seven

Basics

Value: 46066 → 46067 → 46068

Parity: odd

Prime: No

Previous Prime: 46061

Next Prime: 46073

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 6581

Divisors: 1, 7, 6581, 46067

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011001111110011

Octal: 131763

Duodecimal: 227AB

Hexadecimal: b3f3

Square: 2122168489

Square Root: 214.63224361684337

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

a(n) is the smallest ludic number L(k) such that the n-th difference of (L(k), ..., L(k+n)) is zero, where L is A003309; a(n) = 0 if no such number exists. A350006

Numbers n such that n | 9ⁿ + 8ⁿ + 7ⁿ + 6ⁿ + 5ⁿ. A57253

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

Smallest m such that (2n-1)2^m+1 is prime, or -1 if no such value exists. A46067

Array read by antidiagonals, n >= 2, m >= 0: T(n,m) is the smallest ludic number L(k) such that all n-th differences of (L(k), ..., L(k+n+m)) are zero, where L is A003309; T(n,m) = 0 if no such number exists. A350007

Number of inequivalent 9 X 9 matrices with entries from [n], where equivalence means permutations of rows or columns. A246110

Arithmetic mean of next a(n) successive squares of positive integers is a square. A214492