12132
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 30758
- Proper Divisor Sum (Aliquot Sum)
- 18626
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 2022
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 24
- 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
- Sum of cubes of first n Fibonacci numbers.at n=8A005968
- (n / product of digits of n) is a semiprime.at n=27A085773
- Partial sums of A102540 (primes that are not Chen primes).at n=36A115606
- Dividuus numbers: numbers which are divisible by (1) the sum of their digits,(2) the product of their digits,(3) the digital root and (4) the multiplicative digital root.at n=43A118575
- Number of base 6 circular n-digit numbers with adjacent digits differing by 1 or less.at n=9A124699
- Triangle read by rows: T(n,k) is the number of involutions of {1,2,...,n} having k descents (n >= 1; 0 <= k < n).at n=60A161126
- Number of binary strings of length n with no substrings equal to 0001 0010 or 0111.at n=17A164448
- Sizes of successive increasing gaps between 2-pseudoprimes.at n=14A175738
- Sum_{0<j<k<=n} P(k)-P(j), where P(j)=A065091(j) is the j-th odd prime.at n=24A206803
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>n.at n=23A211640
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>=n.at n=23A211641
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..5 array extended with zeros and convolved with 1,3,3,1.at n=19A222024
- Let G denote the 7-node, 12-edge graph formed from a hexagon with main diagonals drawn and a node at the center; a(n) = number of magic labelings of G with magic sum 2n.at n=7A244866
- a(n) = A259708(n,n-1).at n=10A259709
- Words over an alphabet of size 9 that are in standard order with at least one letter repeated.at n=41A273977
- a(n) = smallest k such that the digits of exactly n nonnegative numbers are a subsequence of the digits of k.at n=24A275782
- Numbers k with exactly three distinct prime factors and such that cototient(k) is a square.at n=38A306670
- T(n, k) = Sum_{j=1..k} (1 + 2*cos(j*Pi/(k + 1)))^n for n > 0, T(0, 0) = 1. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=51A342911
- a(n) is the number of graceful graphs with n edges and round(sqrt(3n+9/4)) vertices.at n=19A343296
- Zuckerman numbers which when divided by the product of their digits, give a quotient which is a Niven (Harshad) number.at n=30A343682