13699
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
- 16640
- Proper Divisor Sum (Aliquot Sum)
- 2941
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11016
- Möbius Function
- -1
- Radical
- 13699
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Nonantipodal balanced colorings of n-cube.at n=4A006854
- a(n) = n*(a(n-1) + 1), a(0) = 0.at n=7A007526
- Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=19A007588
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15).at n=42A017846
- a(n) = n*(19*n - 1)/2.at n=38A022276
- Molien series for Hecke group H_{3,4}.at n=20A027631
- Numbers ending with '9' that are the difference of two positive cubes.at n=41A038864
- Numbers k such that 5*2^k + 7 is prime.at n=24A059748
- Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x).at n=29A073107
- Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.at n=28A081114
- Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.at n=14A082458
- Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=21A121662
- Array read by antidiagonals: see A128195 for details.at n=34A126062
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149381
- Products of three distinct happy primes A035497.at n=18A154717
- Products of three distinct primes of the form 6*k + 1.at n=28A154729
- Total Wiener index of double-star trees with n nodes.at n=26A186235
- Small rhombicuboctahedron with faces of centered polygons.at n=9A193250
- Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x-k cycle associated with A226623(n).at n=32A226624
- Number of partitions p of n such that (number of numbers in p of form 3k+1) > (number of numbers in p of form 3k+2).at n=39A241739