ℕ atory
Play Now

Properties of the Number 29723

Twenty-Nine Thousand Seven Hundred Twenty-Three

Basics

Value: 29722 → 29723 → 29724

Parity: odd

Prime: Yes

Previous Prime: 29717

Next Prime: 29741

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 29723

Divisors: 1, 29723

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010000011011

Octal: 72033

Duodecimal: 1524B

Hexadecimal: 741b

Square: 883456729

Square Root: 172.40359625019428

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

Sum of smallest parts (counted with multiplicity) of all partitions of n. A92309
Number of partitions of n having no parts equal to the size of their Durfee squares. A118199
Primes of the form 2·n2 + 50·n + 23. A217496
Number of integer compositions of n whose first differences are not all distinct. A389743
Primes p = pn+1 such that pn + pn+2 = 2·pn+1 + 12. A95673
Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of Delannoy paths of length n, having k EE's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1). A110121
Number of Delannoy paths of length n with no EE's crossing the line y = x (i.e., no two consecutive E steps from the line y = x+1 to the line y = x-1). A110122
Number of lattice paths from (0,0) to the line x+y=n that use the step set {(0,1),(1,0),(2,0),(3,0),...} and never pass below y=x. A89324
Triangle read by rows: odd-numbered rows of A106580. A106595
Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array C(t,r) read by rows. A177020