11357
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11676
- Proper Divisor Sum (Aliquot Sum)
- 319
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11040
- Möbius Function
- 1
- Radical
- 11357
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=34A014813
- Fibonacci sequence beginning 1, 18.at n=15A022108
- [ exp(13/16)*n! ].at n=6A030901
- a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1.at n=31A033498
- Numerators of continued fraction convergents to sqrt(33).at n=8A041054
- Numerators of continued fraction convergents to sqrt(297).at n=8A041558
- a(n) = round(log(n)*2^n/n).at n=15A065614
- a(n) = ceiling(log(n)*2^n/n).at n=15A065615
- Sum of the prime factors of k equals half the sum of the prime factors of k + 1.at n=11A074213
- Floor of concatenation of n, n+1, n+2, n+3, n+4 divided by 5.at n=5A074995
- a(n) = 10*n^2 - 6*n + 1.at n=33A087348
- a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.at n=18A090294
- Integers 1 through n written in primorial base, summed as if decimal.at n=32A122613
- a(n) = n*F(n) - (n-1)*F(n-1), where the F(j)'s are the Fibonacci numbers (F(0)=0, F(1)=1).at n=16A136391
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=22A164766
- Numbers n such that sopfr(n) - (floor(sqrt(n))*bigomega(n)) = floor(sqrt(n)).at n=18A180877
- Floor-Sqrt transform of central trinomial coefficients (A002426).at n=19A192670
- Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal or vertical neighbor, and containing the value n(n+1)/2-2.at n=16A211905
- Number of partitions of n such that the successive differences of consecutive parts are nondecreasing.at n=59A240026
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=28A256519