14968
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 13112
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7480
- Möbius Function
- 0
- Radical
- 3742
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of odd integers <= 2^n of form x^2 + y^2.at n=16A000074
- Square array T(n,k) (row n, column k) read by antidiagonals defined by: T(n,k) is the permanent of the n X n matrix with 1 on the diagonal and k elsewhere; T(0,k)=1.at n=41A090628
- Number of integer-sided pentagons having perimeter n.at n=49A124285
- Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=12A124658
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=24A146922
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=32A185718
- a(n,k) equals (1/n!) multiplied by the count of permutations with cycle length k in all products u v u^-1 v^-1 over all permutations u and v of length n.at n=31A191716
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237466
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237467
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237472
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237472
- Number of nX4 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.at n=8A296323
- Total sum of the left-to-right maxima in all compositions of n into distinct parts.at n=19A336771
- Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from an n x n square grid of points using only a compass.at n=37A359935
- Number of integer partitions of n whose maximal anti-runs have distinct minima.at n=51A375134
- Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], -2/3).at n=20A375597