4954
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7434
- Proper Divisor Sum (Aliquot Sum)
- 2480
- 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
- 2476
- Möbius Function
- 1
- Radical
- 4954
- 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
- 134
- Smith Number
- yes
- 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
- Numbers that are the sum of 5 positive 6th powers.at n=28A003361
- a(n) = floor(1000*log_2(n)).at n=30A004265
- a(n) = round(1000*log_2(n)).at n=30A004266
- Coordination sequence T2 for Zeolite Code MTW.at n=46A008197
- Number of partitions satisfying cn(1,5) <= cn(2,5) + cn(3,5) and cn(4,5) <= cn(2,5) + cn(3,5).at n=32A039890
- Sum of first n lucky numbers.at n=45A046279
- Row 3 of square array defined in A047671.at n=13A047672
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-2)/3.at n=15A048021
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-3)/3.at n=15A048032
- Number of positive integers <= 2^n of form 7 x^2 + 8 y^2.at n=16A054187
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=20A056068
- Number of self-conjugate three-quadrant Ferrers graphs that partition n.at n=44A059777
- Interprimes (A024675) which are of the form s*prime, s=2.at n=36A075277
- Smallest squarefree integer k such that Q(sqrt(k)) has class number n.at n=17A081363
- Reversible Smith numbers, i.e., Smith numbers whose reversal is also a Smith number.at n=35A104171
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=15A104809
- Matrix cube of triangle A105540 and, in this flattened form as read by rows, also equals column 2 of A105540.at n=48A105545
- Expansion of 1/sqrt(1-2x-5x^2-6x^3+9x^4).at n=8A108489
- Numbers n such that first occurrence of the 10 digits of the i-th root of n contain all the digits from 0 to 9.at n=6A119521
- A vector recursion designed around a factorial row sum : v(n)=if[odd,{1.n,n^2,...,(n+1)!/2-Sum[2^m,{m,0,n/2-1}],(n+1)!/2-Sum2^m,{m,0,n/2-1}],...n^2.n,1}],if[ even{1.n,n^2,...,(n+1)!-2Sum[2^m,{m,0,n/2-1}],...n^2.n,1}].at n=24A152938