Properties of the Number 46992

Forty-Six Thousand Nine Hundred Ninety-Two

Basics

Value: 46991 → 46992 → 46993

Parity: even

Prime: No

Previous Prime: 46957

Next Prime: 46993

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 11 × 89

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 16, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011110010000

Octal: 133620

Duodecimal: 23240

Hexadecimal: b790

Square: 2208248064

Square Root: 216.77638247742766

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

Numbers k that divide the sum of the digits of k^k. A108827

E.g.f. satisfies: A'(x) = 1 + x·A(x)⁴ where A(0) = 1. A144014

Totient of the Woodall numbers (A003261), n·2ⁿ -1. A56821

Sum of all parts of all partitions of n minus the number of partitions of n. A182724

a(n) = 24·p(n) = 24·A000041(n). A183008

Number of partitions of n in which two summands (of each size) are designated. A255180

Triangle read by rows: t(n,k)=t(n - 1, k - 1) + 4·t(n - 1, k) + 3·t(n - 1, k - 1). A142597

a(n) = ∑_k=1..n π(k) (cf. A000720). A46992

Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2 X 2 subblock equal. A236886

Smallest number x > 1 such that φ(x) + σ(x) = k·d(x)ⁿ, i.e., the left-hand side is divisible by the n-th power of the number of divisors. A55470