11235
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 9501
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5088
- Möbius Function
- 1
- Radical
- 11235
- 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
- 86
- 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
- a(n) = (4*n+1)*(4*n+3).at n=26A001539
- Number of partitions of n of the form a_1*b_1^2 + a_2*b_2^2 + ...; number of semisimple rings with p^n elements for any prime p.at n=29A004101
- Numbers whose sum of divisors is a fourth power.at n=24A019422
- Concatenation of Fibonacci(1) through Fibonacci(n).at n=4A019523
- a(n) = n*(25*n - 1)/2.at n=30A022282
- Append n-th Fibonacci number to previous term, reverse alternate terms.at n=4A053055
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.at n=40A058366
- a(n) = n*(n+1)*(n^2 + n + 4)/4.at n=14A061316
- Total number of square parts in all partitions of n.at n=26A073336
- Composite numbers k such that (k+1)*sigma(k) is a perfect square.at n=7A073586
- Non-balanced numbers in A015771.at n=19A078549
- Convolution of Fibonacci(n) and 10^n.at n=5A094704
- a(n) = 3*a(n-1) - a(n-2) + a(n-3), a(0)=1,a(1)=1,a(2)=3.at n=10A098182
- Concatenation of first n partition numbers.at n=4A132926
- Numbers n with property that for each single digit d of n, we can also see the decimal expansion of the d-th prime as a substring of n. Also n may not contain any zero digits.at n=0A135015
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=39A136974
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1110-0111-0001 pattern in any orientation.at n=12A147400
- Indices of primes in the Padovan sequence A000931.at n=22A152870
- Quintisection A061037(5*n+2).at n=42A165248
- a(n) = A061037(7*n+2).at n=30A165943