7954
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
- 8
- Divisor Sum
- 12348
- Proper Divisor Sum (Aliquot Sum)
- 4394
- 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
- 3840
- Möbius Function
- -1
- Radical
- 7954
- 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
- 145
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for MgNi2, Position Mg1.at n=22A009936
- 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 88.at n=14A031586
- Number of partitions of n into parts not of the form 25k, 25k+8 or 25k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=32A036007
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 53.at n=2A093253
- a(n) is the smallest natural number m such that n^m + m is prime.at n=5A093324
- Positions where A109890(n) = Sum_{i = 1..n-1} A109890(i).at n=24A111315
- Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=3A124658
- Coefficients of tribonacci numbers expansion : similar to the Fibonacci number expansion given in Steve Roman's Umbral Calculus.at n=23A137431
- a(n) = the smallest multiple of the n-th prime such that (a(n)+1) is divisible by both the (n-1)th prime and the (n+1)st prime.at n=11A143243
- 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, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0), (1, 0, 1)}.at n=7A150491
- a(n) = 729*n^2 - 1016*n + 354.at n=3A157665
- A sequence of triples of squarefree consecutive integers each composed of exactly three primes.at n=40A165936
- Number of partitions of n in which some but not all parts are equal.at n=32A167930
- Parameters n for which the elliptic curve y^2=x^3+n has rank 4.at n=6A179124
- Number of permutations of 0..(n-1) representable as consecutive sums of 7 adjacent elements of a sequence of n+6 nonnegative integers.at n=12A180210
- Half the number of n X 3 binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies.at n=5A183249
- Half the number of n X 6 binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies.at n=2A183252
- T(n,k)=Half the number of nXk binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies.at n=30A183253
- T(n,k)=Half the number of nXk binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies.at n=33A183253
- Number of (n+1)X(n+1) 0..2 arrays with each 2X2 subblock determinant nonzero and the array of 2X2 subblock determinants symmetric under horizontal and vertical reflection.at n=2A187697