7570
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13644
- Proper Divisor Sum (Aliquot Sum)
- 6074
- 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
- 3024
- Möbius Function
- -1
- Radical
- 7570
- Omega Function (Ω)
- 3
- 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
- 132
- 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 sensed loopless planar maps with n edges.at n=8A006390
- Number of labeled Eulerian 3-regular digraphs with n nodes.at n=6A007105
- Number of labeled 2-regular digraphs with n nodes.at n=6A007107
- Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,1.at n=8A033121
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=47A036810
- Sums of 6 distinct powers of 3.at n=41A038468
- Number of nonisomorphic orthogonal arrays OA(4n,4n-1,2,2).at n=6A048885
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=28A060879
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.at n=43A069894
- Numbers k such that reverse(k) is a prime factor of k.at n=44A072299
- Number of permutations of length n which avoid the patterns 1342, 3421, 4213.at n=8A116802
- Let p_n be the polynomial of degree n-1 that interpolates the first n primes (i.e., p_n(i) = prime(i) for 1 <= i <= n.) Then a(n) = p_n(n+1)/2.at n=15A121049
- First differences of A139334.at n=53A139335
- a(n) = 250*n - 180.at n=31A154360
- a(n) = 841*n + 1.at n=8A158404
- Convolution square of A001157 (the sum of squared divisors).at n=9A175705
- Number of 8-hoops with n symbols and no a-rooted trees.at n=4A210766
- Numbers k such that the period of Fibonacci numbers mod k is 3*(k+10).at n=35A229466
- Numbers whose square is a fourth power plus a prime.at n=15A236767
- Number of n X 2 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=9A240359