14402
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22800
- Proper Divisor Sum (Aliquot Sum)
- 8398
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6804
- Möbius Function
- -1
- Radical
- 14402
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Numbers that are the sum of 7 nonzero 8th powers.at n=20A003385
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=40A010002
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=30A010006
- a(0) = 1, a(n) = 25*n^2 + 2 for n > 0.at n=24A010015
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)+1 are twin primes with p(h) = h-th prime.at n=23A129311
- a(n) = 3600*n^2 + n.at n=1A157861
- T(n,k)=Number of nXnXn triangular 0..k arrays with every horizontal row nondecreasing and having the same average value.at n=53A214906
- Number of 3 X n 0..1 arrays with diagonals and antidiagonals unimodal and rows nondecreasing.at n=26A223950
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=4A234483
- Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=0A234487
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=10A234490
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=14A234490
- Numbers m with C(2*m, m) + prime(m) prime, where C(2*m, m) = (2*m)!/(m!)^2.at n=42A236242
- Least positive integer k such that both k and k*n belong to the set {m>0: 2*prime(prime(m))+1 = prime(p) for some prime p}.at n=31A261362
- Number of set partitions of [n] with alternating parity of elements and exactly seven blocks.at n=6A305781
- Number of set partitions of [n] with alternating parity of elements and exactly ceiling(n/2) blocks.at n=13A305785
- Triangular array read by rows. T(n,k) is the number of length n words on alphabet {0,1} with k maximal runs of 0's having length 2 or more, n>=0, 0<=k<=nearest integer to n/3.at n=52A334658
- Number of partitions of n into an odd number of parts that are not multiples of 4.at n=46A339407
- Values of terms in A380837 which are not in A379066.at n=15A380838