Properties of the Number 46072

Forty-Six Thousand Seventy-Two

Basics

Value: 46071 → 46072 → 46073

Parity: even

Prime: No

Previous Prime: 46061

Next Prime: 46073

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 13 × 443

Divisors: 1, 2, 4, 8, 13, 26, 52, 104, 443, 886

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011001111111000

Octal: 131770

Duodecimal: 227B4

Hexadecimal: b3f8

Square: 2122629184

Square Root: 214.6438911313341

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

Number of subsets of {1..n} (including empty set) such that the pairwise sums of distinct elements are all distinct. A196723

Shifts left under transform T where Ta is a DCONV a. A38044

Numbers t which satisfy the equation: t mod k = floor((t - k)/k) mod k (1 <= k <= t) only for k = 1 and t. A375007

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k pyramids of the first kind (a pyramid of the first kind is a sequence u^pd^p for some positive integer p, starting at the x-axis). A108451

Numbers n such that n!!! - 3¹⁰ is prime, where n!3 = n!!! is a triple factorial number (A007661). A265201

Number of sets of nonempty words over binary alphabet with a total of n letters of which 2 are the first letter. A360650

Catacondensed simply-connected monopentapolyhexes. A24311

Numbers k such that 2·3^k + 35 is prime. A59768

Decompose multiplicative group of integers modulo n as a product of cyclic groups C_k₁ x C_k₂ x ... x C_{k_m}, where k_i divides k_j for i < j; then a(n) = m. A46072