13253
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13740
- Proper Divisor Sum (Aliquot Sum)
- 487
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12768
- Möbius Function
- 1
- Radical
- 13253
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Coordination sequence for sigma-CrFe, Position Xc.at n=29A009961
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=31A056132
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.at n=34A057654
- Number of distinct Cunningham chains of first kind whose initial prime (cf. A059453) <= 2^n.at n=20A059690
- Integer part of n#/((p-3)# 3#), where p=preceding prime to n.at n=59A102786
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 0100-1100-1111 pattern in any orientation.at n=10A146786
- 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, 0), (-1, 0, -1), (-1, 1, 1), (1, -1, -1), (1, 1, 1)}.at n=8A149529
- Positive numbers y such that y^2 is of the form x^2+(x+457)^2 with integer x.at n=7A160580
- Last term where no prime sums occur in A161190 in a 4-diagonal set of 24 terms.at n=4A161193
- Number of 4 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=24A188555
- 0-sequence of reduction of (3n-2) by x^2 -> x+1.at n=13A192311
- Total number of nested arcs in the set partitions of n.at n=7A200673
- Numbers k such that k!4 + 2^6 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=26A291347
- Bases b where exactly seven primes p with p < b exist such that p is a base-b Wieferich prime.at n=29A325883
- a(n) is the minimum number of squares from which an n-fold totally concave polyomino (n-TCP) can be made.at n=45A385602