12060
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
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 37128
- Proper Divisor Sum (Aliquot Sum)
- 25068
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 2010
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=26A020342
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=45A033579
- Product of order of cycles of the permutation created by duality and reversal on the partitions of n.at n=12A036047
- Numbers m such that prime(m) + Fibonacci(m) is prime.at n=15A050180
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=13A061364
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.at n=34A070996
- Eighth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself.at n=4A073397
- Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-, the 132- and the 321-pattern is equal to k.at n=51A094067
- Threefold convolution of A004148 (the RNA secondary structure numbers) with itself.at n=11A098075
- Triangle T(n, k) = k^2*(1+n)^2 - 4*n, read by rows.at n=65A123961
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=5A135196
- Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=4A144563
- Number of different fixed (possibly) disconnected trominoes bounded (not necessarily tightly) by an n*n square.at n=9A162673
- Numbers k such that k^2 +-11 are primes.at n=37A176683
- Least b > p_n^2 such that [p_1^2,p_2^2,...,p_n^2] in base b is prime, where p_j denotes the j-th prime.at n=27A224197
- Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with pi <= i.at n=38A238875
- Number of length 4 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=10A244907
- Integers n such that n^2 = 2*x*(y-x), where x and y are consecutive terms in A014574.at n=9A255230
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 or 00000011.at n=10A259716
- Coordination sequence for (2,5,infinity) tiling of hyperbolic plane.at n=20A265068