12081
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16112
- Proper Divisor Sum (Aliquot Sum)
- 4031
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8052
- Möbius Function
- 1
- Radical
- 12081
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Quadruples of different integers from [ 1,n ] with no global factor.at n=24A015622
- Pisot sequence P(5,11), a(0)=5, a(1)=11, a(n+1) is the nearest integer to a(n)^2/a(n-1).at n=10A021008
- Number of binary [ n,3 ] codes.at n=21A034357
- TrueSoFar number of terms in other bases.at n=12A102844
- sigma(n) plus the n-th prime gives a square.at n=43A114082
- A bisection of A129095: a(n) = A129095(2n-1) for n>=1.at n=46A129096
- Lower triangular array called S2hat(-1) related to partition number array A144269.at n=48A144270
- Numbers that take a record number of steps to appear in A181391.at n=44A171863
- Number of primitive permutations with n buds and 3 red or blue elements.at n=4A226270
- Number of partitions of n such that (number of distinct parts) >= least part.at n=34A239952
- Numbers whose trajectories under the map x -> A230625(x) never reach a prime.at n=46A288847
- a(n) is the number of simple graphs of order n having at most one cycle (such graphs are called "at most unicyclic graphs").at n=11A291648