5013
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7254
- Proper Divisor Sum (Aliquot Sum)
- 2241
- 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
- 3336
- Möbius Function
- 0
- Radical
- 1671
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Squares written in base 6.at n=33A001741
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=42A002569
- Coordination sequence T4 for Zeolite Code SGT.at n=44A008232
- Molien series for A_10.at n=32A008633
- Number of partitions of n into at most 10 parts.at n=32A008639
- a(n) = n*(31*n-1)/2.at n=18A022288
- Numbers k such that Fib(k) == -34 (mod k).at n=31A023169
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes.at n=18A024697
- Number of partitions of n in which the greatest part is 10.at n=42A026816
- a(n) = 5^n mod 2^n.at n=13A029757
- Number of ordered pairs of integers (x,y) with x^2+y^2 < n^2.at n=40A051132
- Expansion of x/((1-x)*(1-x^2-2*x^3)).at n=21A077882
- a(n) = 3*a(n-1) + 2*a(n-2) + a(n-3) if n>=3, otherwise a(n) = n.at n=8A100477
- Table of number of domino tilings of generalized Aztec pillows of type (1, ..., 1, 3, 1, ..., 1)_n.at n=25A112830
- Self-describing sequence. See the sequence as a succession of digits: then a(n) is the position of a composite digit in the sequence.at n=49A114318
- Position of n! among the lexicographically ordered permutations of digits of n!.at n=11A116983
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=24A127485
- Positions of 10 after decimal point in decimal expansion of 1/Pi.at n=43A134260
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1110-0111 pattern in any orientation.at n=14A146473
- Triangle read by rows: T(n,k) = number of permutations of {1..n} with at most k inversions.at n=60A161169