12011
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12012
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12010
- Möbius Function
- -1
- Radical
- 12011
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1440
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes in ternary.at n=33A001363
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=32A002148
- Primes having only {0, 1, 2} as digits.at n=11A036953
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=13A045156
- Successive positions in Tower of Hanoi (with three pegs {0,1,2}) where xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.at n=20A055662
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=27A058944
- Smallest primes whose residue modulo its difference from the next prime is 2n-1.at n=12A060235
- Each permutation in the list A060118 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.at n=37A060499
- Primes whose sum of digits is 5.at n=19A062341
- Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.at n=30A065020
- Primes which, although they have correct parity, are not in the prime number maze.at n=24A065123
- Smallest prime p of two consecutive primes, p < q, such that gcd(p+1, q+1) = 2n.at n=12A067604
- Primes with arithmetic mean of digits = 1 (sum of digits = number of digits).at n=9A069710
- Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.at n=27A071154
- Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.at n=27A071160
- Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit).at n=20A071161
- Variant of the factorial base representation of n.at n=37A072001
- Numbers n of the form k + reverse(k) for exactly two k.at n=29A072040
- Primes which can be represented as the sum of a number and its reverse.at n=30A072382
- Primes of form 4k+3 written in base 3.at n=17A072805