13802
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21216
- Proper Divisor Sum (Aliquot Sum)
- 7414
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6732
- Möbius Function
- -1
- Radical
- 13802
- 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
- 45
- 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
- a(n) = 10000*log_10(n) rounded down.at n=23A004228
- a(n) = 10000*log_10(n) rounded to the nearest integer.at n=23A004229
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=33A016728
- Numbers in which all pairs of consecutive base-5 digits differ by 2.at n=43A033083
- Numbers d_n used in recurrence for series-parallel numbers.at n=26A036655
- Numbers n such that n*6^n - 1 is prime.at n=17A059675
- Number of partitions of n with at most two even parts.at n=42A096778
- The (1,1)-entry of the matrix M^n, where M is the 5 X 5 matrix [[0,1,0,0,0],[0,0,1,0,0], [0,0,0,1,0], [0,0,0,0,1], [1,0,-1,1,1]].at n=31A107293
- a(n) = A005291(n) + A005291(n+1).at n=32A195308
- Number A(n,k) of solid standard Young tableaux of n cells and height <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=74A215086
- Number of length 3 arrays x(i), i=1..3 with x(i) in i..i+n and no value appearing more than 2 times.at n=22A250352
- G.f.: x * Product_{k>=1} (1 + k*x^k)^a(k).at n=7A308205
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=8A317233
- Number of solid standard Young tableaux of n cells and height <= 3.at n=8A320180