7385
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10176
- Proper Divisor Sum (Aliquot Sum)
- 2791
- 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
- 5040
- Möbius Function
- -1
- Radical
- 7385
- 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
- 70
- 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
- 4-dimensional analog of centered polygonal numbers.at n=15A006325
- Primitive repfigit numbers.at n=12A006576
- Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers).at n=14A007629
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=37A024841
- Character of extremal vertex operator algebra of rank 35/2.at n=3A028540
- Number of partitions of n^2 into distinct squares.at n=39A030273
- Numbers whose maximal base-9 run length is 4.at n=13A037999
- Numbers k such that phi(k) is equal to A008473(k-1).at n=4A039780
- Numbers having four 1's in base 9.at n=8A043460
- Second pentagonal numbers with even index: a(n) = n*(6*n+1).at n=35A049453
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=13A049946
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=44A051897
- Let u be any string of n digits from {0,...,3}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-4 number; then a(n) = max_u f(u).at n=10A065845
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=14A070192
- Multiply-Add Recurrence Invariant (MARI) numbers.at n=28A121235
- Product of successive primes minus 2.at n=22A124669
- Keith numbers together with the numbers from 0 through 9.at n=24A130010
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=42A160353
- a(n) = n*(16*n^2 + 3*n - 13)/6.at n=14A172078
- Number of connected graphs with n edges embeddable into square lattice.at n=13A181528