Properties of the Number 74053

Seventy-Four Thousand Fifty-Three

Basics

Value: 74052 → 74053 → 74054

Parity: odd

Prime: No

Previous Prime: 74051

Next Prime: 74071

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 71 × 149

Divisors: 1, 7, 71, 149, 497, 1043, 10579, 74053

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010000101000101

Octal: 220505

Duodecimal: 36A31

Hexadecimal: 12145

Square: 5483846809

Square Root: 272.1268086756614

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) = ∑_i=0..n (-2)^n-i*B(i)*binomial(n,i) where B(n) = Bell numbers A000110(n). A126617

a(n) = 68·n² + 1. A158732

Number of 5 X n 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing. A224149

Numbers n such that p(n) is congruent to n mod σ(n), where p(n) denotes the n-th prime. A66688

T(n,k) = Number of n X k 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing. A224146

T(n,k) = number of arrays of n 0..k integers with new values introduced in order 0..k but otherwise unconstrained. Array read by antidiagonals. A203647

Number of ways of placing n labeled balls into 9 indistinguishable boxes; word structures of length n using a 9-ary alphabet. A164863

Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n. A74053

G.f. satisfies: A(x) = 1 + x*∑_n>=0 log( A(2ⁿ*x) )ⁿ/(2ⁿ*n!). A181588