Properties of the Number 90272

Ninety Thousand Two Hundred Seventy-Two

Basics

Value: 90271 → 90272 → 90273

Parity: even

Prime: No

Previous Prime: 90271

Next Prime: 90281

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 7 × 13 × 31

Divisors: 1, 2, 4, 7, 8, 13, 14, 16, 26, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110000010100000

Octal: 260240

Duodecimal: 442A8

Hexadecimal: 160a0

Square: 8149033984

Square Root: 300.45299133142277

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

Irregular triangle read by rows: first row is 1, and the n-th row gives the coefficients in the expansion of (1/2·x)*(1 - 2·x*(1 - x))^{n + 1}*Li(-n, 2·x*(1 - x)), where Li(n, z) is the polylogarithm. A142147

Irregular triangle read by rows: T(n,k) is the number of n-permutations whose second-longest cycle has length exactly k; n>=0, 0<=k<=floor(n/2). A349979

Largest members of fully k-sociable cycles of order r. A183023

Conjectured list of fully multisociable numbers. A183029

Expansion of x³*(x-1)*(x+1) / (x⁵-2·x⁴+x²-1). A135990

Let S(n)=σ(n)/3. Numbers k such that S^m(k)=k, 1/3-sociable numbers (of any order). A356548

Bell or exponential numbers: number of ways to partition a set of n labeled elements. A110

Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column. A2720

Take each palindrome ending in 1, 3, 7, or 9 and find smallest prime formed by the digits of that palindrome, followed by a string of digits, followed by the palindrome again. A90272