14225
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17670
- Proper Divisor Sum (Aliquot Sum)
- 3445
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11360
- Möbius Function
- 0
- Radical
- 2845
- Omega Function (Ω)
- 3
- 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
- 50
- 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
- no
- Odd
- yes
Appears in sequences
- Future of the smallest-perizeroin komet in Kimberling's expulsion array (A035486).at n=28A038807
- Conjectured positive numbers which have more than one representation (m,s) as a difference s^2 - m^5, m >= 1, s > 0.at n=30A177770
- Number of obtuse triangles, distinct up to congruence, on an n X n grid (or geoboard).at n=18A190022
- Hyper-Wiener index of a benzenoid consisting of a double-step spiral chain of n hexagons (n >= 2, s = 21; see the Gutman et al. reference).at n=6A193398
- Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=5A207882
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=50A207885
- Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=4A207888
- Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution x to A328248(x) = n-1.at n=33A328250
- a(n) is the number of partitions of n without repeated odd parts such that the total number of parts congruent to 0,3, or 5 modulo 8 is even.at n=52A335745
- Numbers that are the sum of six fourth powers in four or more ways.at n=10A345561
- Numbers that are the sum of six fourth powers in exactly four ways.at n=10A345816
- Consecutive states of the linear congruential pseudo-random number generator 259*s mod 2^15 when started at s=1.at n=20A384194