11247
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15744
- Proper Divisor Sum (Aliquot Sum)
- 4497
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7128
- Möbius Function
- -1
- Radical
- 11247
- 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
- 60
- 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 whose base-4 representation contains exactly three 2's and four 3's.at n=2A045152
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.at n=27A049726
- Numbers k such that 7*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A056720
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th Fibonacci number is in antidiagonal a(n).at n=38A057042
- Number of divisors d of n! such that d+1 is prime.at n=20A067847
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=33A090424
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=43A090495
- Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.at n=11A092291
- Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=13A129133
- Binomial transform of A077947.at n=9A139782
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=7A151057
- Maximally refined partitions into distinct parts (of any natural number) with largest part n.at n=24A179822
- Floor(1/{(7+n^4)^(1/4)}), where {}=fractional part.at n=26A184631
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=8A196573
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=57A196578
- Numbers k such that A206369(k) = A206369(k + 1).at n=18A206368
- Triangle, read by rows, of permutations of length n with k white global corners.at n=30A213166
- a(n) = arrange digits of concatenation of divisors of n (A037278, A176558) in increasing order in base 10 (zero digits are omitted).at n=13A243361
- Number of terms of A072873 less than or equal to 10^n.at n=35A267757
- Number of nXnXn triangular 0..7 arrays with new values introduced in sequential zero-upwards order and exactly one inverted 2x2x2 triangle having values all equal.at n=3A271406