13141
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13932
- Proper Divisor Sum (Aliquot Sum)
- 791
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12352
- Möbius Function
- 1
- Radical
- 13141
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Parenthesized one way gives the powers of 2: (1), (2), (1+3), ..., another way the powers of 3: (1), (2+1), (3+6), ....at n=22A006895
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=42A007773
- [ exp(23/24)*n! ].at n=6A030837
- Column 4 of triangle A055907.at n=8A055910
- a(n) = 10*n^2 + 5*n + 1.at n=36A080860
- Natural numbers written out with their digits grouped in sets of 5 (leading zeros omitted).at n=3A091341
- Number of binary trees of weight n where leaves have positive integer weights, where the order of subtrees is insignificant. Commutative non-associative version of partitions of n.at n=12A113822
- Put the natural numbers together without spaces and read them five at a time advancing one space each time.at n=15A193493
- A recurrence relation conditioned on the primality of the preceding terms.at n=36A236768
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=21A241049
- Positions of records in A166133.at n=30A256404
- Numbers n such that A166133(n) sets a new record and also satisfies A166133(n)=A166133(n-1)^2-1.at n=15A256422
- One half of numbers representable in at least two different ways as sums of four nonvanishing cubes. See A259060 for these numbers and their representations.at n=8A261241
- Pseudoprimes to base 9, written in base 9.at n=49A262154
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 433", based on the 5-celled von Neumann neighborhood.at n=25A272147
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 822", based on the 5-celled von Neumann neighborhood.at n=28A272847
- Numbers k such that A339549(k) = A339549(k+1).at n=16A339550
- Number of integer partitions of n where the parts have lesser mean than the distinct parts.at n=35A360251
- Centered pentagonal numbers which are squarefree semiprimes.at n=28A381043
- Centered pentagonal numbers which are semiprimes.at n=28A382132