7415
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8904
- Proper Divisor Sum (Aliquot Sum)
- 1489
- 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
- 5928
- Möbius Function
- 1
- Radical
- 7415
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 132
- 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
- n written in fractional base 10/7.at n=35A024662
- Least term in period of continued fraction for sqrt(n) is 9.at n=9A031433
- a(n) = ceiling((n + 1/2)^3).at n=18A034131
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 3 (mod 5).at n=53A035585
- Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 3 (mod 5).at n=59A035588
- Numbers k such that 2*k+1, 3*k+2 and 4*k+3 are primes.at n=33A126955
- an=n-th smallest integer of the form m=p1*p2 where pi are odd primes such that d+2m/d are all primes for d dividing 2m.at n=45A128279
- Largest integer terms forming a self-convolution square-root of a sequence A132831 such that: A132831(n) <= 2*A132831(n-1) for n>0 with A132831(0)=1.at n=16A132832
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 2X3 U in any orientation.at n=12A146060
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 10101-11111 pattern in any orientation.at n=12A147424
- a(n) = T(10,n), array T given by A047858.at n=9A195858
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 4,2,0,2,2,0,0 for x=0,1,2,3,4,5,6.at n=4A198006
- a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n^3.at n=19A227012
- Odd semiprimes that can be represented as 2p+3q, where p and q are primes, in an increasing number of ways.at n=49A280406
- a(1) = 1; a(n+1) = n + Sum_{d|n} a(d).at n=45A345140
- Numbers that are the sum of ten fourth powers in exactly seven ways.at n=30A345859
- Number of noncrossing partitions of the n-set with no pair of singletons {i} and {j} that can be merged into {i,j} and leave the partition a noncrossing partition.at n=10A363448