5121
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7410
- Proper Divisor Sum (Aliquot Sum)
- 2289
- 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
- 3408
- Möbius Function
- 0
- Radical
- 1707
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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
- Sum of 11 positive 9th powers.at n=10A004800
- Numbers that are the sum of 6 positive 10th powers.at n=5A004806
- Numbers that are the sum of at most 6 nonzero 10th powers.at n=26A004901
- Numbers that are the sum of at most 7 nonzero 10th powers.at n=31A004902
- Numbers that are the sum of at most 8 nonzero 10th powers.at n=36A004903
- Numbers that are the sum of at most 10 nonzero 10th powers.at n=46A004905
- a(n) = n*2^(n-1) + 1.at n=10A005183
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=47A007664
- Numbers k such that the continued fraction for sqrt(k) has period 84.at n=10A020423
- Expansion of Product_{m>=1} (1+x^m)^5.at n=10A022570
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=40A023180
- n written in fractional base 9/5.at n=37A024653
- a(n) = position of n^3 + 9 in A003072.at n=35A024971
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 42 ones.at n=17A031810
- Sort then Add, a(1) =9.at n=10A033896
- Sort then Add, a(1)=27.at n=8A033903
- Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.at n=40A035949
- a(n) = T(7,n), array T given by A048471.at n=4A036548
- Sums of 3 distinct powers of 4.at n=30A038471
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=10A045036