12271
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14032
- Proper Divisor Sum (Aliquot Sum)
- 1761
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10512
- Möbius Function
- 1
- Radical
- 12271
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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
- Number of elements in Z[ omega ] whose 'smallest algorithm' is <= n, where omega^2 = -omega - 1.at n=7A006458
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=29A020435
- Numbers k such that Fib(k) == -13 (mod k).at n=40A023167
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=46A027419
- Sums of 12 distinct powers of 2.at n=20A038463
- Numbers k such that 1 + product of first k composite numbers is prime.at n=21A053982
- Triangle read by rows: T(i,j) = (T(i-1,j) + i)*i.at n=23A121682
- a(n) = sum of n successive primes after the n-th prime.at n=40A131740
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=15A166057
- G.f.: A(x) = exp( Sum_{n>=1} [Sum_{k>=0} a(k)^n* x^k]^n* x^n/n ).at n=7A179500
- Minimal natural number (in decimal representation) with n prime substrings in binary representation (substrings with leading zeros are considered to be nonprime).at n=44A217302
- Minimal natural number (in decimal representation) with n prime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=18A217304
- Odd numbers n such that the sum of the binary digits of n and n^2 both equal 12.at n=6A261593
- List of numbers n whose base-3 expansion contains only the digits 1 and 2 and whose base-4 expansion contains only the digits 2 and 3.at n=12A262963
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=16A263510
- a(n+1) = a(n) + p, where p is the largest prime less than a(n); a(1) = 3.at n=13A285010
- Consecutive states of the linear congruential pseudo-random number generator (1741*s + 2731) mod 12960 when started at s=1.at n=30A385335