7535
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9936
- Proper Divisor Sum (Aliquot Sum)
- 2401
- 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
- 5440
- Möbius Function
- -1
- Radical
- 7535
- 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
- 88
- 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
- no
- Odd
- yes
Appears in sequences
- Molien series for real extraspecial group 2^{1+2*3} of degree 8 and order 128 formed from tensor products of Pauli matrices (0,1, 1,0) and (1,0, 0,-1).at n=9A014095
- n written in fractional base 9/7.at n=32A024655
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=27A049791
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=30A052049
- a(n) = Sum_{d|n} phi(d^4).at n=11A068970
- Numerator of Product_{k=1..n} H(k), where H(k) = Sum_{j=1..k} 1/j, the k-th harmonic number.at n=4A097423
- Least multiple of prime(n) containing only prime digits (2,3,5,7).at n=32A113590
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+337)^2 = y^2.at n=7A129999
- a(n) = sum of n successive primes after the n-th prime.at n=32A131740
- Triangle read by rows: T(n,k) is the number of paths of length n with steps U=(1,1), D=(1,-1) and H=(1,0), starting at (0,0), staying weakly above the x-axis (i.e., left factors of Motzkin paths) and having k peaks (i.e., UDs), 0 <= k <= floor(n/2).at n=31A132893
- Numbers k such that k and k^2 use only the digits 2, 3, 5, 6 and 7.at n=19A137080
- Right edge of triangular table A138612.at n=26A166019
- Let n be the number whose square n^2 has the decimal expansion { d(1) d(2) ... d(D) }, and let q be the corresponding number whose decimal expansion is { d(2) d(3) ... d(D) d(1)}. Sequence lists numbers n dividing q.at n=39A177928
- Start with 1. Successive digits in the sequence must differ by 2. Adjoin the smallest number not yet in the sequence.at n=32A228328
- Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=42A240178
- Number of partitions p of n such that (number of even numbers in p) >= (number of odd numbers in p).at n=35A241639
- Least number k such that k concatenated with n is a cube, or 0 if no such k exists.at n=70A246561
- Numbers k such that k+s+c is a square, where s is the nearest square to k and c is the nearest cube to k.at n=48A269569
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood.at n=21A269908
- Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n that remain unchanged under the operation of replacing a permutation with its inverse.at n=22A277081