12311
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13272
- Proper Divisor Sum (Aliquot Sum)
- 961
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11352
- Möbius Function
- 1
- Radical
- 12311
- 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
- 156
- 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
- Numerators of continued fraction convergents to sqrt(431).at n=7A041820
- a(n) = 1 + (number of partitions of n, n>0).at n=34A052810
- Numbers whose product of decimal digits equals its sum of binary digits.at n=22A064003
- Smallest number k such that n! - k is a square.at n=10A066857
- Structured small rhombicubeoctahedral numbers.at n=12A100149
- 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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 0, -1), (1, 0, 0)}.at n=9A148704
- a(n) = 324n - 1.at n=37A158306
- a(n) = 38*n^2 - 1.at n=17A158596
- Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=10A169822
- Numbers whose product of digits is 6.at n=41A199988
- Composite numbers whose product of digits is 6.at n=27A201055
- Number of n X 2 0..2 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=10A201533
- Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=13A219111
- Number of nX4 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=2A223957
- T(n,k)=Number of nXk 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=17A223961
- Number of 3 X n 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=3A223963
- Least number k >= 0 such that n! - k is a perfect power.at n=10A240940
- Number of (n+1) X (1+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=3A250846
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=9A250853
- Number of (4+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=0A250856