11696
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 24552
- Proper Divisor Sum (Aliquot Sum)
- 12856
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 1462
- Omega Function (Ω)
- 6
- 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
- 143
- Smith Number
- yes
- 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
- First occurrence of n consecutive numbers that take same number of steps to reach 1 in 3x+1 problem.at n=11A000546
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=31A024972
- a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2*n-1) = 7. Also a(n) = T(2*n-1,n-3), where T is the array defined in A026009.at n=6A026018
- Larger of Smith brothers.at n=8A050220
- a(n) = n*(n+1)*(n^2 + 2)/6.at n=16A071239
- Let b(0)=1; b(1)=1; b(n+2)=(e^g+1/e^g)*b(n+1)-b(n). a(n)=floor(b(n)).at n=17A093608
- Numerator of sum of reciprocals of first n pentatope numbers A000332.at n=23A118411
- Inverse of Riordan array (1/(1+x+x^2),x/(1+x)^2).at n=48A122919
- Triangle read by rows: T(n,m)=A154694(n,m)-A154694(n,0)+1.at n=16A174673
- Triangle read by rows: T(n,m)=A154694(n,m)-A154694(n,0)+1.at n=19A174673
- a(n) = n*(n + 1)*(17*n - 14)/6.at n=16A237617
- Coefficients of mock modular form H_2^(7) of type 1A, divided by 4.at n=29A256057
- a(n) = (-3 - 28*3^n + 73*15^n)/21.at n=3A260846
- Alternating sum of hexagonal pyramidal numbers.at n=32A266677
- Numbers which are representable as a sum of seventeen but no fewer consecutive nonnegative integers.at n=15A270302
- Take apart the sides of each of the integer-sided scalene triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total surface area of all rectangular prisms enclosed in this way.at n=33A308235
- Expansion of Product_{k>=1} (Product_{j=1..k} 1/(1 - x^(k*j))^j).at n=24A327066
- Number of Sós permutations of {0,1,...,n}.at n=32A330503
- Greater of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.at n=1A357496
- Least number k having n subsets of its divisors whose sum is k+1.at n=44A359197