13450
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25110
- Proper Divisor Sum (Aliquot Sum)
- 11660
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5360
- Möbius Function
- 0
- Radical
- 2690
- Omega Function (Ω)
- 4
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for body-centered tetragonal lattice.at n=41A008527
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=38A025000
- Number of rooted trees with n nodes and 3 leaves.at n=26A055278
- a(n) = (2*n-1)^2 + (2*n+1)^2.at n=41A108100
- Triangle T, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) for n>k+1>=1, with T(n,n) = 1 and T(n+1,n) = n+1 for n>=0, where T^2 is the matrix square of T.at n=36A109152
- Column 0 of triangle A109152.at n=8A109153
- Number of fusenes with 23 hexagons, C_(2h) symmetry and containing 2n carbon atoms.at n=6A122096
- Number of 2n-digit primes that are concatenation of n two-digit distinct primes p_1...p_n: 10<p_1<p_2<...<p_n>98.at n=11A168519
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=34A245209
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 01010101 or 01010111.at n=9A260131
- 1^2 + 3^2, 2^2 + 4^2, 5^2 + 7^2, 6^2 + 8^2, ...at n=40A276764
- Numbers n such that there is exactly one nontrivial square n-gonal number.at n=59A277449
- Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals three.at n=11A288542
- a(n) = A005259(n) mod (n+1)^3.at n=34A289289
- a(n) is the number of integer partitions of n for which the greatest part minus the least part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=52A318176
- a(n) is the greatest k > 0 such that Sum_{j=1..n} j*k^j/(k+n) is an integer, for n > 1.at n=3A335112