5627
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5976
- Proper Divisor Sum (Aliquot Sum)
- 349
- 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
- 5280
- Möbius Function
- 1
- Radical
- 5627
- 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
- 59
- 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
- From the powers that be.at n=8A004143
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=25A010002
- a(0) = 1, a(n) = 25*n^2 + 2 for n > 0.at n=15A010015
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 20 (most significant digit on right and removing all least significant zeros before concatenation).at n=6A029537
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 75.at n=0A031573
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 75.at n=0A031753
- Number of partitions of n into parts not of the form 13k, 13k+6 or 13k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=34A035954
- a(n) = 2^n*Sum_{k=0..n} (n+k)!/((n-k)!*k!*4^k).at n=5A043301
- Numbers k such that k | sigma_11(k) - phi(k)^11.at n=10A055705
- Ultra-useful primes: smallest k such that 2^(2^n) - k is prime.at n=15A058220
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=5A061364
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=31A064906
- Sums of groups in A075639.at n=12A075640
- "Orders" where balanced prime number records (A082080) occur.at n=44A096692
- a(1)=1. a(n) = Sum_{1<=k<n, gcd(k,n(n+1))=1} a(k).at n=36A125596
- Row sums from A144562.at n=16A144640
- 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), (0, 0, 1), (0, 1, 0), (1, 1, -1)}.at n=8A149880
- a(n) = 4*n*(n+1) + 3.at n=37A164897
- Places n for which A046132(n) and A006512(n) is a twin prime pair.at n=42A174042
- Upper Beatty array of sqrt(3).at n=29A182786