4070
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 4138
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1440
- Möbius Function
- 1
- Radical
- 4070
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 157
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n into at most 6 parts.at n=41A001402
- Number of walks on cubic lattice.at n=21A005570
- Primitive pseudoperfect numbers.at n=55A006036
- Coordination sequence T2 for Zeolite Code -WEN.at n=46A009863
- Expansion of 1/((1-x) * (1-4*x) * (1-7*x) * (1-10*x)).at n=3A021874
- Number of partitions of n into 6 unordered relatively prime parts.at n=41A023026
- Coordination sequence T7 for Zeolite Code MWW.at n=42A024992
- Number of partitions of n in which the greatest part is 6.at n=47A026812
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=33A035951
- Composites n such that A001414(n) is odd and divides n.at n=35A036346
- Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).at n=47A039597
- Numbers k such that the string 0,7 occurs in the base 10 representation of k but not of k-1.at n=43A044339
- Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=12A046358
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n-4)/2.at n=15A048063
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n+2)/3.at n=15A048074
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n+3)/3.at n=15A048085
- Revert transform of (1 + 3x - x^3)/(1 + 4x + 4x^2 + 2x^3).at n=10A049146
- Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).at n=37A049450
- Largest denominator in unit fraction representation of triangle of numbers 1/2, 1/3, 2/3, 1/4, 2/4, ... as computed with greedy algorithm.at n=52A050210
- Number of ordered pairs of complementary subsets of an n-set with both subsets of cardinality at least 2.at n=12A052515