13462
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 7274
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6552
- Möbius Function
- -1
- Radical
- 13462
- 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
- 45
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers whose sum of divisors is a fourth power.at n=34A019422
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=37A064009
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).at n=32A068473
- Numbers n such that sigma(n) = product of the squares of the decimal digits of n.at n=3A068572
- Numbers k such that sigma(k) mod pi(k) = 1.at n=14A073723
- Number of partitions of (n,n) into pairs (i,j) with i>0, j>=0.at n=11A108457
- a(n) = 6*a(n-1) - 8*a(n-2) + 2 for n > 1; a(0) = 1, a(1) = 8.at n=6A171478
- Number of line segments connecting exactly 6 points in an n x n grid of points.at n=31A177722
- Partial sums of cuban primes A002407, that is, primes equal to the difference of two consecutive cubes.at n=15A221793
- Number of tilings of a 5 X n rectangle using integer-sided square tiles of area > 1.at n=56A226369
- Table T(n,k), n>=1, k>=1, read by antidiagonals: T(n,k) = number of equivalence classes of ways of placing five 1 X 1 tiles in an n X k rectangle under all symmetry operations of the rectangle.at n=40A248017
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=30A271010
- Number of sequences of n positive integers with reciprocals adding up to an integer.at n=4A280517
- Expansion of Sum_{i>=1} x^(i^3) / (1 - Sum_{j>=1} x^(j^3))^2.at n=35A281809
- Number of sets of exactly n positive integers <= n+5 having a square element sum.at n=36A281968
- T(j,k) are the numerators u in the representation R = s/t + (2/Pi)*u/v of the resistance between two nodes separated by the distance vector (j,k) in an infinite square lattice of one-ohm resistors, where T(j,k), j >= 0, 0 <= k <= j, is a triangle read by rows.at n=24A355566
- a(n) is the area of the smallest rectangle that the Harter-Heighway Dragon Curve will fit in after n doublings, starting with a segment of length 1.at n=13A362566