11473
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
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 2927
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8880
- Möbius Function
- -1
- Radical
- 11473
- 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
- 112
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=14A057290
- a(n) = n*(2*n^2 -3*n +7)/6 = C(n, 1) + C(n, 2) + 2*C(n, 3).at n=32A081489
- Difference between the sum of next prime(n) natural numbers and the sum of next n primes.at n=17A082749
- n+p(n)+p(p(n)) is a square, where p(n) is the n-th prime.at n=6A116011
- G.f. satisfies A(x) = 1 + x*A(x)^2 + x^2*(A(x)^2 - A(x)).at n=9A119370
- Extrapolation for (n + 1)-st odd prime made by fitting least-degree polynomial to first n odd primes.at n=14A140118
- G.f.: A(x) = Sum_{n>=0} x^n*A(x)^(n*2^n).at n=6A177402
- Number of strings of numbers x(i=1..6) in 0..n with sum i^3*x(i) equal to 216*n.at n=17A184261
- Number of 2n X 2 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly one horizontal and vertical neighbor.at n=3A198405
- T(n,k) = Number of 2n X 2k 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly one horizontal and vertical neighbor.at n=6A198408
- T(n,k) = Number of 2n X 2k 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly one horizontal and vertical neighbor.at n=9A198408
- T(n,k)=Number of 2nX2k 0..4 arrays with values 0..4 introduced in row major order and each element equal to an odd number of horizontal and vertical neighbors.at n=6A198534
- T(n,k)=Number of 2nX2k 0..4 arrays with values 0..4 introduced in row major order and each element equal to an odd number of horizontal and vertical neighbors.at n=9A198534
- a(n) is the smallest number of the form k*a(n-1)+a(n-2) for k>0 that is relatively prime to n, with a(0) = 0 and a(1) = 1.at n=18A206241
- Number of (w,x,y) with all terms in {0,...,n} and n/2 < w+x+y <= n.at n=41A212977
- Real part of Sum_{k=0..n} (k + i^k)^2, where i=sqrt(-1).at n=32A236377
- a(n) = n*(n+1)*(7*n+2)/6.at n=21A255211
- The icosagen sequence : a(n) = A018227(n)-5, for n >= 2.at n=37A271997
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 441", based on the 5-celled von Neumann neighborhood.at n=24A272223
- Number of compositions of n into parts with distinct multiplicities and with exactly seven parts.at n=41A321777