7012
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12278
- Proper Divisor Sum (Aliquot Sum)
- 5266
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3504
- Möbius Function
- 0
- Radical
- 3506
- Omega Function (Ω)
- 3
- 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
- 57
- 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
- Numbers that are the sum of 5 positive 6th powers.at n=35A003361
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=16A020425
- Number of 4-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=4.at n=14A027559
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=28A031804
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=11A065903
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)^2).at n=19A083708
- Look at the first 10 digits of the sequence: they are all different. The same for the next 10. And the next 10, etc. This sequence is the slowest increasing one with that property.at n=43A097912
- Coefficients of replicable function number "48h".at n=53A112192
- Number of length n binary sequences with at most 2 of every adjacent 6 bits set.at n=19A133523
- a(n) = 4*3^n+4^n.at n=6A147536
- 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, 0), (-1, 1, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1)}.at n=8A148914
- a(n) = (9*n^2 + 9*n - 16)/2.at n=38A166148
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=40A178980
- Number of rhombuses on a (n+1)X8 grid.at n=30A190096
- Monotonic ordering of set S generated by these rules: if x and y are in S then floor(x*y/2) is in S, and 5 is in S.at n=25A192520
- Expansion of series_reversion( x/(1+x^4*sum(k>=0, x^k)) ) / x.at n=19A215341
- Integers n such that 6n -/+ 1 and 30n -/+ 1 are all primes.at n=46A216847
- Number of involutions avoiding the pattern 1342.at n=11A230553
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 625", based on the 5-celled von Neumann neighborhood.at n=46A273270
- Shifts 4 places left under binomial transform.at n=16A275934