7425
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 7455
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 165
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- no
- 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
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1.at n=16A000322
- a(n) = n^2*(n+1)^2*(n+2)/12.at n=9A004302
- Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m).at n=14A005231
- Odd primitive abundant numbers.at n=11A006038
- Triangle read by rows, the inverse Bell transform of n!*binomial(5,n) (without column 0).at n=11A013988
- a(n) = (d(n)-r(n))/5, where d = A026057 and r is the periodic sequence with fundamental period (1,0,3,1,0).at n=53A026059
- a(n) = floor(n/2) * floor((n-1)/2) * floor((n-2)/2) * floor((n-3)/2) * floor((n-4)/2) / 12.at n=22A028725
- Odd numbers divisible by exactly 6 primes (counted with multiplicity).at n=21A046319
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= (n-2)/3.at n=15A048017
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= (n-3)/3.at n=15A048028
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= sqrt(n).at n=15A048094
- 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).at n=33A051868
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.at n=30A051871
- a(n) = floor(exp(n/Pi)).at n=27A062121
- a(n) = 3*n*(4*n-1).at n=25A062783
- a(n) = 11*n^2 + 22*n.at n=24A067705
- Partial sums of A084570.at n=19A084569
- Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.at n=5A087415
- Coefficient triangle for computation of column numbers of triangle A071951 (Legendre-Stirling).at n=16A089278
- Numbers k divisible by at least one nontrivial permutation (rearrangement) of the digits of k, excluding all permutations that result in digit loss.at n=2A090056