12027
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
- 8
- Divisor Sum
- 16960
- Proper Divisor Sum (Aliquot Sum)
- 4933
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- -1
- Radical
- 12027
- Omega Function (Ω)
- 3
- 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
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of positive integers <= 2^n of form x^2 + 6 y^2.at n=16A000077
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=68A011907
- Pseudoprimes to base 58.at n=40A020186
- Strong pseudoprimes to base 58.at n=13A020284
- a(n) = (C(2n, n)/2 - (2^(n-1) + ((n+1) mod 2)*C(n-1, n/2-1)))/2.at n=8A042971
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=7A045152
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=21A065903
- For n > 1, a(n) is the smallest number such that n-th concatenation is prime and the smallest palindrome beginning with (but not equal to) this concatenation is also prime.at n=34A088090
- 4th diagonal of triangle in A059317.at n=40A106058
- a(n) = 9*n^2 - 8*n + 2.at n=37A154254
- Base 10 representation of the string formed by appending primes in base 2.at n=4A164893
- Partial sums of floor(n^3/3).at n=19A173707
- a(n) = n*(17*n - 13)/2.at n=38A180232
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=33A214359
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=20A214373
- Expansion of (1+4*x+8*x^2-x^3)/((1-x)*(1+x)*(1-3*x^2)).at n=15A224785
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right.at n=26A234691
- Number of partitions of n such that no part is a prime divisor of n.at n=39A237125
- Maximal sum of x0 + x0*x1 + ... + x0*x1*...*xk over all compositions x0 + ... + xk = n.at n=24A239288
- Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=0A252304