7637
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 1099
- 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
- 6540
- Möbius Function
- 1
- Radical
- 7637
- Omega Function (Ω)
- 2
- 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
- 39
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 12.at n=27A050961
- Numbers n such that phi(3n-1) = sigma(n).at n=39A067232
- a(n) = A076969(n)^(1/3).at n=35A076970
- Gregorian calendar years with Ascension Day in April.at n=30A084427
- Recursively defined polynomials, read by row.at n=46A109086
- Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.at n=44A168659
- Vertex number of a rectangular spiral which contains exactly between its edges the successive shells of the partitions of the positive integers.at n=48A194450
- Total sum of parts of multiplicity 10 in all partitions of n.at n=38A222738
- Numbers n such that 6n -/+ 1 are twin prime pair and n = r + s where 6r -/+ 1 and 6s -/ 1 are consecutive smaller pairs of twin primes.at n=50A226652
- Number of (n+2)X(1+2) 0..1 arrays x(i,j) with every row sum{j*x(i,j), j=1..1+2} equal, and every column sum{i*x(i,j), i=1..n+2} equal, with upper left element zero.at n=17A232648
- Number of partitions p of n such that floor(mean(p)) or ceiling(mean(p)) is a part.at n=33A241344
- Number of (n+2)X(1+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=6A252954
- T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=27A252961
- Number of (7+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=0A252968
- Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north, west, northeast or southeast neighbor modulo n and the upper left element equal to 0.at n=5A266852
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west, northeast or southeast neighbor modulo n and the upper left element equal to 0.at n=26A266854
- Numbers n such that 3^n == 5 (mod n).at n=7A276740
- Number of nX2 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.at n=7A282990
- T(n,k) is the number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.at n=37A282996
- T(n,k) is the number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.at n=43A282996