13359
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18352
- Proper Divisor Sum (Aliquot Sum)
- 4993
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 13359
- 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
- 68
- 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
- a(n) = floor(e^((n-1)/2)).at n=20A005182
- Numbers k such that k and 7*k are anagrams.at n=6A023091
- Numerators of continued fraction convergents to sqrt(301).at n=8A041566
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=11A045262
- Numbers k such that k^6 == 1 (mod 7^4).at n=34A056092
- Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.at n=25A090838
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k hills of the form ud (a hill is either a ud or a Udd starting at the x-axis).at n=30A108433
- phi(n) plus the n-th prime gives a square.at n=34A116021
- Numbers n such that 2*11^n + 1 is prime.at n=8A141774
- a(n) = floor(e^(n + 1/2)).at n=9A219092
- Numbers x whose digits can be permuted to produce a multiple of x.at n=19A245680
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or southwest neighbors modulo n and the upper left element equal to 0.at n=49A267655
- Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north or southwest neighbors modulo 5 and the upper left element equal to 0.at n=5A267657
- a(n) = A277715(n) / 3.at n=56A277716
- Number of palindromes < 10^n whose squares are also palindromes.at n=38A343098