5031
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
- 12
- Divisor Sum
- 8008
- Proper Divisor Sum (Aliquot Sum)
- 2977
- 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
- 3024
- Möbius Function
- 0
- Radical
- 1677
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 116
- 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
- Number of 5th-order maximal independent sets in path graph.at n=48A007380
- a(n) = n*(31*n + 1)/2.at n=18A022289
- a(n) is least k such that k and 6k are anagrams in base n (written in base 10).at n=37A023098
- a(n)=(s(n)+5)/10, where s(n)=n-th base 10 palindrome that starts with 5.at n=25A043084
- Numbers n such that 51*2^n-1 is prime.at n=23A050551
- Number of positive integers <= 2^n of form 2 x^2 + 7 y^2.at n=15A054157
- Number of square binary matrices with n ones, with no zero rows or columns, up to row and column permutation.at n=11A057151
- McKay-Thompson series of class 42b for Monster.at n=43A058676
- a(n) = 3*n^2 + 12*n.at n=38A067707
- Numbers which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=52A068679
- Number of unimodal partitions/compositions of n into distinct terms.at n=32A072706
- Numbers k such that A068340(k)=+/-4.at n=7A077032
- Convolution of A000203 with partition function (A000041) of positive integers.at n=15A086732
- Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n: (1, 2), (3, 4, 5), (6, 7, 8), (9, 10, 11, 12, 13, 14, 15), (16, 17, 18, 19), (20, 21, 22, 23, 24, 25, 26, 27, 28), (29, 30, 31, 32, 33, 34), ... Sequence contains the group sums.at n=42A088099
- Fourth column (m=3) of (1,6)-Pascal triangle A096956.at n=25A096957
- a(n) = Sum_{k=0..floor(n/7)} C(n-5*k,2*k).at n=28A098574
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k valleys.at n=41A101282
- Start to read the sequence digit by digit and erase the first "1" you encounter, then the first "2", the first "3", etc., until the first "0"; go on from there and erase again the first "1", the first "2", etc., until "0" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence.at n=7A108710
- Binomial transform of A000796.at n=10A110810
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=68A119455