11832
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
- 32
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 20568
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 0
- Radical
- 2958
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 99
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Coordination sequence for A_8 lattice.at n=3A008391
- Number of compositions (ordered partitions) of n into distinct odd parts.at n=50A032021
- Numbers k such that sigma(totient(k)) + sigma(cototient(k)) = 2k.at n=2A037138
- a(n) = lcm(4n, A025586(4n)), least common multiple of 4n and the largest value in 3x+1 iteration list started at 4n.at n=50A087261
- Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=24A089435
- Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.at n=32A092000
- Numbers n such that 3^n-2^(n-1) is prime.at n=29A095906
- Square array T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n.at n=58A103881
- a(n)=a(n-1)+sum of digits(a(n-1))*sum of digits(a(n-2)).at n=44A108720
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=40A112787
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+17)^2 = y^2.at n=12A118120
- Expansion of phi(-q^9) / phi(-q) in powers of q where phi() is a Ramanujan theta function.at n=22A128770
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=4A134263
- Numbers k such that k-1, k+1, and k^2-k-1 are primes.at n=39A154666
- a(n) = 7*a(n-1) - 7*a(n-2) + a(n-3) for n > 2; a(0) = 0, a(1) = 51, a(2) = 340.at n=4A155464
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 6.at n=7A157052
- Number of (n+1)X4 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=3A206201
- Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=2A206202
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=17A206206
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=18A206206