Properties of the Number 1472

One Thousand Four Hundred Seventy-Two

Basics

Value: 1471 → 1472 → 1473

Parity: even

Prime: No

Previous Prime: 1471

Next Prime: 1481

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁶ × 23

Divisors: 1, 2, 4, 8, 16, 23, 32, 46, 64, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111000000

Octal: 2700

Duodecimal: A28

Hexadecimal: 5c0

Square: 2166784

Square Root: 38.36665218650175

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

Ramanujan's τ function (or Ramanujan numbers, or τ numbers). A594

Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined. A15128

Numbers that are divisible by exactly 7 primes counting multiplicity. A46308

Triangle read by rows: T(n,k) = number of inequivalent linear [n,k] binary codes without 0 columns (n >= 1, 1 <= k <= n). A34253

Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p). A241638

Number of partitions of n into parts 1/2, 3/4, 7/8, 15/16, etc. A2843

a(n) = (3·n-1) * 2^n-2. A53220

Numbers with one fewer divisors than the sum of their prime indices. A325694

a(n) = n*(n + 14). A98848

T(n,k) = number of length n 1..(k+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal. A254218