5629
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6076
- Proper Divisor Sum (Aliquot Sum)
- 447
- 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
- 5184
- Möbius Function
- 1
- Radical
- 5629
- 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
- 173
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=15A001210
- a(n) = C(n,5) + C(n,4) - C(n,3) + 1, n >= 7.at n=10A005288
- a(n) = ceiling((n/e)^n).at n=8A015557
- Numbers whose set of base-12 digits is {1,3}.at n=26A032919
- Numbers each of whose runs of digits in base 12 has length 2.at n=34A033010
- Positive integers having more base-12 runs of even length than odd.at n=36A044838
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=3A045132
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=10A045216
- a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=33A046259
- a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.at n=37A066529
- Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.at n=29A069833
- Smallest k such that d(phi(k)) - phi(d(k)) = n, where d(k) = A000005(k) and phi(k) = A000010(k).at n=32A078150
- a(n) = 4*(n+1)*n + 5.at n=37A078370
- Maximal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d=6*p (p=any odd prime).at n=8A093300
- Triangle T(n,k) of elements of n-th Weyl group of type B whose reduced word uses n-k generators.at n=30A109281
- Triangle P, read by rows, such that P^2 transforms column k of P into column k+1 of P, so that column k of P equals column 0 of P^(2*k+1), where P^2 denotes the matrix square of P.at n=51A113340
- Triangle, read by rows, given by the product Q^2*P^-1, where the triangular matrices involved are P = A113340 and Q = A113350.at n=41A113369
- Prime indices with record values of the least positive primitive root.at n=11A114885
- Array read by antidiagonals: see A128195 for details.at n=31A126062
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=8A148882