7558
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11340
- Proper Divisor Sum (Aliquot Sum)
- 3782
- 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
- 3778
- Möbius Function
- 1
- Radical
- 7558
- 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
- 83
- 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
- yes
- Odd
- no
Appears in sequences
- Number of compositions of n into positive triangular numbers.at n=22A023361
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 86.at n=11A031584
- Multiplicity of highest weight (or singular) vectors associated with character chi_6 of Monster module.at n=44A034394
- Number of partitions of n into parts not of the form 21k, 21k+8 or 21k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=32A035986
- Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives total population of triangles at n-th generation.at n=17A061777
- Consecutive terms of A065966 which are also consecutive integers.at n=21A065976
- Convolution of the prime numbers with phi(n).at n=27A086734
- Triangular matrix, read by rows, where row n is formed from the first differences of row (n-1) of its inverse matrix square, with an appended '1' for the main diagonal.at n=15A102583
- Column 0 of triangular matrix A102583, in which row n is formed from the first differences of row (n-1) of its inverse matrix square.at n=5A102585
- Euler's totient of A104357(n) = A104350(n) - 1.at n=7A104363
- Index k of the least colossally abundant number c=A004490(k) with sigma(c)/c >= n.at n=18A110443
- Number of closed lambda-terms of size n with size 1 for the variables.at n=10A135501
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1)}.at n=8A148997
- Maximal length of rook tour on an n X n+1 board.at n=21A152132
- Maximal length of rook tour on an n X n+3 board.at n=20A152134
- Nonnegative numbers n such that 6*2^n-1 is prime.at n=29A164523
- Jumping divisor sequence (see Comments lines for definition).at n=60A168007
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*(1 + x*A(x)^n)^n.at n=9A186998
- Number of (n+2)X(n+2) binary arrays avoiding patterns 000 and 101 in rows and columns.at n=2A203083
- Number of (n+2)X5 binary arrays avoiding patterns 000 and 101 in rows and columns.at n=2A203086