Properties of the Number 90060

Ninety Thousand Sixty

Basics

Value: 90059 → 90060 → 90061

Parity: even

Prime: No

Previous Prime: 90059

Next Prime: 90067

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 19 × 79

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111111001100

Octal: 257714

Duodecimal: 44150

Hexadecimal: 15fcc

Square: 8110803600

Square Root: 300.0999833388866

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 permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}. A79955

a(n) = ∑_{k=0..floor(n/5)} C(n-4k,k+1). A99559

a(n) = 100·n² + 2·n. A158127

Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells. A85

a(n) = 2*(a(n-1) + (n-1)*a(n-2)) for n >= 2 with a(0) = 1. A898

Number of permutations in S_n with longest increasing subsequence of length <= 3 (i.e., 1234-avoiding permutations); vexillary permutations (i.e., 2143-avoiding). A5802

a(n) = 2·a(n-1) + (n-1)*a(n-2). A5425

Number of permutations in S_n with longest increasing subsequence of length <= 4. A47889

Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n). A47874

Number of permutations avoiding the consecutive pattern 1234. A117158