11925
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 21762
- Proper Divisor Sum (Aliquot Sum)
- 9837
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 795
- Omega Function (Ω)
- 5
- 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
- 94
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 2's in n-th term of A007651.at n=37A022467
- Expansion of 1/((1-4x)(1-8x)(1-10x)(1-11x)).at n=3A028158
- a(n) = (2*n+1)*(12*n+1).at n=22A033576
- a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=0, a(1)=1, a(2)=3.at n=16A049859
- Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^2 where w, x, y, and z are all positive integers.at n=22A057369
- For the numbers k that can be expressed as k = w + x = y*z with w*x = y^2 + z^2 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.at n=12A057444
- Numbers k such that the Lucas Aurifeuillian primitive part A of Lucas(k) is prime.at n=47A061442
- a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).at n=23A071289
- Third convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.at n=8A073373
- a(n) = 4^n + 5^n + 6^n.at n=5A074561
- Sum of next n 5th powers.at n=2A075666
- a(n) = Sum_{i=1..n} (n-i+1)*phi(i).at n=48A103116
- 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, 1), (-1, 0, 0), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=10A148153
- Generating function A(5,t)(1+t+t^2)/(1-t)^6, where A(5,t) is an Eulerian polynomial.at n=5A179995
- Numbers k such that k^2+2, k^3+2, k^4+2 and k^5+2 are all prime.at n=4A214001
- Numbers k such that k + 2, k^2 + 2, k^3 + 2, k^4 + 2 and k^5 + 2 are all prime.at n=2A216930
- Numbers which are the sums of consecutive fifth powers.at n=18A217845
- Number of n X 2 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value 2-x(i,j).at n=5A229841
- Number of nX6 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value 2-x(i,j).at n=1A229845
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value 2-x(i,j).at n=22A229847