5046
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10452
- Proper Divisor Sum (Aliquot Sum)
- 5406
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1624
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 4
- 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
- 134
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T3 for Zeolite Code MEP.at n=42A008159
- Number of partitions of n into an even number of parts, the least being 2; also, a(n+2) = number of partitions of n into an odd number of parts, each >=2.at n=44A027194
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=34A027575
- a(n) = (n+1)! + n.at n=6A030495
- a(n) = 6*n^2.at n=29A033581
- Numbers having three 6's in base 8.at n=29A043447
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=64A046770
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=64A046782
- Numbers k such that phi(k) = phi(k - phi(k)).at n=27A051487
- Numbers k such that 295*2^k + 1 is prime.at n=22A053364
- a(n) = Sum_{k=1..n} phi(k)^2.at n=31A057434
- Sums of nonconsecutive factorial numbers.at n=24A060112
- 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=38A060133
- Sum of factorials of the digits of n.at n=37A061602
- usigma(n) = 2n + d(n), where d(n) is the number of divisors of n.at n=8A063829
- Start of n-th segment of Recamán's sequence R(m) (A005132): values of n where the change in the fractional parts of successive values of R(n)/n is positive.at n=14A064492
- Coordination sequence for ReO_3 net with respect to Re atom.at n=41A066714
- Integers of the form m! + n!, m and n = positive integers.at n=23A066847
- Numbers k such that sigma(core(k)) = tau(k) where core(k) is the squarefree part of k, tau(k) is the number of divisors of k, and sigma(k) is their sum.at n=35A069827
- Smallest of 4 consecutive numbers each divisible by a square.at n=11A070284