6276
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14672
- Proper Divisor Sum (Aliquot Sum)
- 8396
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2088
- Möbius Function
- 0
- Radical
- 3138
- Omega Function (Ω)
- 4
- 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
- 36
- 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
- Triangle of numbers of hybrid rooted trees (divided by Fibonacci numbers).at n=30A011274
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 52.at n=27A031550
- Numbers k such that 211*2^k+1 is prime.at n=8A032482
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=18A048189
- McKay-Thompson series of class 25A for Monster.at n=25A058594
- The array of A059578 read by antidiagonals in the 'up' direction.at n=32A059579
- Numbers k for which phi(prime(k)) is a square.at n=41A062325
- Number of perfect matchings in variant of right triangle graph with n edges.at n=8A071105
- Number of perfect matchings in variant of right triangle graph with n edges where n runs through numbers congruent to 0 or 3 mod 4.at n=4A071106
- Numbers k such that k#*2^k-1 is prime, where k# = product of primes <= k.at n=50A084406
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=33A084804
- Number of one-bit dominant primes (A095070) in range ]2^n,2^(n+1)].at n=16A095020
- Number of A095286-primes in range ]2^n,2^(n+1)].at n=16A095296
- Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=7A097647
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=25A113537
- Numbers n with nonzero digits in their decimal representation such that when all numbers formed by inserting the exponentiation symbol between any two digits are added up, the sum is prime.at n=39A113762
- Triangle, read by rows, where the g.f. of row n divided by (1-x)^n yields the g.f. of column n in the triangle A122888, for n>=1.at n=41A122890
- The indices of cubes (of primes) in the 3-almost primes.at n=9A128302
- Numbers m for which Sum_digits(m!) is a multiple of Sum_digits(m!!).at n=39A135206
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (1, -1, 1), (1, 0, 0), (1, 1, 0)}.at n=7A150362