Properties of the Number 90042

Ninety Thousand Forty-Two

Basics

Value: 90041 → 90042 → 90043

Parity: even

Prime: No

Previous Prime: 90031

Next Prime: 90053

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 43 × 349

Divisors: 1, 2, 3, 6, 43, 86, 129, 258, 349, 698

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111110111010

Octal: 257672

Duodecimal: 44136

Hexadecimal: 15fba

Square: 8107561764

Square Root: 300.06999183523834

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

Second-order Eulerian triangle T(n,k), 1 <= k <= n. A8517

Second-order Eulerian numbers: a(n) = 2ⁿ - 2·n. A5803

Number of rooted bicubic maps: a(n) = (8·n-4)*a(n-1)/(n+2) for n >= 2, a(0) = a(1) = 1. A257

a(1)=2, a(2)=5; for n >= 3, a(n) is smallest number which is uniquely of the form a(j) + a(k) with 1 <= j < k < n. A7300

Second-order Eulerian numbers <<n+1,n-1>>. A2538

E2(n, k), the second-order Eulerian numbers with E2(0, k) = δ_{0, k}. Triangle read by rows, E2(n, k) for 0 <= k <= n. A340556

Eulerian numbers of the second kind: <<n+3, n>>. A2539

a(n) = 2·a(n-1) + 11·a(n-2) for n > 1, a(0) = a(1) = 1. A90042

Continued fraction expansion of ∑_k>=0 1/(k!)!. A336810

Second-order Eulerian numbers <<n,2>>. A4301