5042
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7566
- Proper Divisor Sum (Aliquot Sum)
- 2524
- 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
- 2520
- Möbius Function
- 1
- Radical
- 5042
- 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
- 41
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(1) = 2, a(n) = 4*a(n-1) - a(n-2).at n=7A001075
- a(2*n) = a(2*n-1) + a(2*n-2), a(2*n+1) = 2*a(2*n) + a(2*n-1); a(0) = a(1) = 1.at n=14A002531
- a(n) = (1 + a(n-1)*a(n-2))/a(n-3), a(0) = a(1) = a(2) = 1.at n=15A005246
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)).at n=21A005468
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=19A007589
- Coordination sequence T1 for Zeolite Code ATO.at n=47A008265
- Numbers whose least quadratic nonresidue (A020649) is 11.at n=31A025024
- Sum of partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).at n=21A056871
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.at n=19A057654
- Sums of nonconsecutive factorial numbers.at n=23A060112
- Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.at n=37A060133
- Sum of distinct orders of degree-n permutations.at n=20A060179
- Sum of factorials of the digits of n.at n=27A061602
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=39A064933
- Integers of the form m! + n!, m and n = positive integers.at n=22A066847
- a(n) = prime(n)^2 + 1.at n=19A066872
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 13.at n=16A068034
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.at n=35A069894
- a(n) = Min_{k | A071891(k) = n}.at n=9A071893
- a(n) = 3*n^2 - 1.at n=40A080663