Properties of the Number 14799

Fourteen Thousand Seven Hundred Ninety-Nine

Basics

Value: 14798 → 14799 → 14800

Parity: odd

Prime: No

Previous Prime: 14797

Next Prime: 14813

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 4933

Divisors: 1, 3, 4933, 14799

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100111001111

Octal: 34717

Duodecimal: 8693

Hexadecimal: 39cf

Square: 219010401

Square Root: 121.65114056185416

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 partitions of n with a product greater than n. A114324

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (1/n) * ∑_j=1..n 3^j * binomial(n,j) * binomial(k·n,j-1) for n > 0. A336575

a(0) = 1 and a(n) = (1/n) * ∑_k=1..n 3^k * binomial(n,k) * binomial(n²,k-1) for n > 0. A336578

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that min(x(i) - x(i-1)) < number of distinct parts of p. A241823

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2. A221361

Pisot sequence E(8,10), a(n) = floor( a(n-1)²/a(n-2) + 1/2 ). A10916

G.f. A(x) satisfies A(x) = 1 + x·A(x)⁴ * (2 + A(x)). A336540

Nonnegative integers k such that k! mod nextprime(k) is larger than k. A360805

Square of Riordan array (1, x·c(x)) where c(x) is the g.f. of A000108. A127631

a(n) = 400·n - 1. A158317