Properties of the Number 29790

Twenty-Nine Thousand Seven Hundred Ninety

Basics

Value: 29789 → 29790 → 29791

Parity: even

Prime: No

Previous Prime: 29789

Next Prime: 29803

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 331

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010001011110

Octal: 72136

Duodecimal: 152A6

Hexadecimal: 745e

Square: 887444100

Square Root: 172.5977983637103

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 integer partitions of n not containing their mean. A327472

Jordan function J₃(n). A59376

a(n) = n³ - 1. A68601

a(n) = ∑_{d∣n, n/d=1 mod 4} d³ - ∑_{d∣n, n/d=3 mod 4} d³. A50471

T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k. A245995

Multiplicative with a(p^e) = 1 - p³. A63453

a(n) = 1 - n³. A24001

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 1. Also a(n) = T(n,n-1), where T is the array defined in A024996. A24998

Number of partitions of n such that m(greatest part) = m(1), where m = multiplicity. A240078

Numbers k such that k² has digits in nonincreasing order. A28821