7070
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 7618
- 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
- 2400
- Möbius Function
- 1
- Radical
- 7070
- 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
- 150
- 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
- Expansion of 1/((1-5x)(1-6x)(1-8x)(1-9x)).at n=3A028170
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=13A031690
- a(n) = n*(n+1)*(5*n+1)/6.at n=19A033994
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=48A035577
- Numbers with exactly 4 distinct palindromic prime factors.at n=14A046402
- Numbers whose consecutive digits differ by 7.at n=22A048409
- a(n) = 3^n+2*2^n-3.at n=8A072674
- Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).at n=58A079124
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.at n=27A080957
- Number of leg-hypotenuse twin Pythagorean triples < 10^n.at n=7A101904
- Row sums of A104975.at n=48A104976
- Row sums of A104975.at n=49A104976
- Row sums of A117692.at n=6A117693
- Undulating Harshad numbers: numbers divisible by the sum of their own digits with decimal expansions in an abab...ab pattern.at n=39A129120
- Row sums of triangle A132921.at n=17A132922
- Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=14A136959
- a(n) = 250*n - 180.at n=29A154360
- Number of distinct interlace polynomials q of connected graphs of order n.at n=9A156804
- a(n) = 36*n^2 + n.at n=13A157324
- 144n^2 + 2n.at n=6A158132