Properties of the Number 14742

Fourteen Thousand Seven Hundred Forty-Two

Basics

Value: 14741 → 14742 → 14743

Parity: even

Prime: No

Previous Prime: 14741

Next Prime: 14747

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 7 × 13

Divisors: 1, 2, 3, 6, 7, 9, 13, 14, 18, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100110010110

Octal: 34626

Duodecimal: 8646

Hexadecimal: 3996

Square: 217326564

Square Root: 121.41663806908838

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

a(n) = ∑_k=0..n p(k) where p(k) = number of partitions of k (A000041). A70

Number of palindromic partitions of n. A25065

Number of ternary Lyndon words whose digits sum to 1 (or 2) mod 3; number of trace 1 (or 2) monic irreducible polynomials over GF(3). A46211

Inverse Euler transform of primes. A30010

Number of partitions of n with at most one odd part. A100824

-1 + ∏_n>=1 (1 + xⁿ)^a(n) = g.f. of A000040 (prime numbers). A305871

Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes. A208437

Heinz numbers of integer partitions such that 3*(sum) = (reverse-weighted sum). A363531

Numbers k such that prime(k+3)-(k+3)*τ(k+3) = prime(k-3)-(k-3)*τ(k-3) where τ(k) = A000005(k) is the number of divisors of k. A67355

Number of times prime(n) occurs as the least prime factor among numbers 1 .. prime(n)⁴: a(n) = A078898(A030514(n)). A250478