13357
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14478
- Proper Divisor Sum (Aliquot Sum)
- 1121
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12312
- Möbius Function
- 0
- Radical
- 703
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- Number of permutations of [n] in which the longest increasing run has length 2.at n=7A000303
- Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.at n=29A008304
- a(n) = (2*n - 1)*n^2.at n=19A015237
- Pseudoprimes to base 28.at n=38A020156
- Pseudoprimes to base 54.at n=34A020182
- Pseudoprimes to base 69.at n=39A020197
- 22-gonal numbers: a(n) = n*(10*n-9).at n=37A051874
- Numbers k such that 2*k! + 1 is prime.at n=16A051915
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=17A054236
- a(n) is the least number k that A074389(k) = n.at n=18A074390
- a(n) = floor(average of first n cubes).at n=36A078618
- Number of balanced numbers <= 2^n.at n=33A078662
- Numbers which are sums of two and also sums of three positive cubes.at n=24A085336
- Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1.at n=36A087442
- Numbers which are the sum of two positive cubes and divisible by 37.at n=15A102618
- Numbers which are the sum of two positive cubes and divisible by 19.at n=30A102619
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, for n>4: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5)], where SORT places digits in ascending order and deletes 0's.at n=42A108566
- Number of domino tilings of a 3-pillow of order n.at n=6A112833
- Row sums of A128623.at n=36A128624
- Partial sums of A139250.at n=41A160424