11470
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
- 16
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 10418
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 1
- Radical
- 11470
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 174
- 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 equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors (excluding the proper divisor 1). Rearrangements which cause leading zeros are excluded.at n=7A086248
- a(n) = 2*n*(6*n-1).at n=31A126964
- a(n) = (p(n)*p(n+2) - 3*p(n+1))/2, where p(n) is the n-th odd prime.at n=33A152529
- Partial sums of A006899.at n=19A170803
- Triangle T(n, k) = c(n) - c(k) - c(n-k), where c(n) = Product_{j=0..n} Partitions(j), read by rows.at n=48A172971
- Triangle T(n, k) = c(n) - c(k) - c(n-k), where c(n) = Product_{j=0..n} Partitions(j), read by rows.at n=51A172971
- Number of strings of numbers x(i=1..8) in 0..n with sum i^2*x(i)^3 equal to 64*n^3.at n=13A184323
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >= 2n.at n=13A210367
- Number of unordered interval sequences that sum up to 12n in Schoenberg 12-tone rows.at n=4A215605
- Number of unordered interval sequences that sum up to 12n in Schoenberg 12-tone rows.at n=6A215605
- Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=13A238226
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=17A245209
- Numerator of Product_{j=1..n-1} ((3*j+1)/(3*j+2)).at n=13A271919
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=33A272788
- Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X m square.at n=13A274582
- Number of maximal cubefree binary words of length n.at n=32A282133
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 589", based on the 5-celled von Neumann neighborhood.at n=13A283173
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 2 S - S^2 + S^3.at n=9A291242
- Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).at n=42A306547
- Greater members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=2A322254