5573
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5574
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 5572
- Möbius Function
- -1
- Radical
- 5573
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 36
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 736
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=28A004966
- Expansion of sin(log(1+x)/cosh(x)).at n=9A009466
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=33A015990
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=16A020384
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 13.at n=19A050962
- Second term of weak prime quintets: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=13A054824
- McKay-Thompson series of class 45A for Monster.at n=48A058684
- Primes p such that p^11 reversed is also prime.at n=26A059704
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=32A065214
- Primes containing 2k digits in which the sum of the first k digits is that of the last k digits.at n=29A068896
- Primes which are not the difference between two successive perfect powers (A001597).at n=43A077286
- Primes p such that floor(p^Pi) is prime.at n=35A079594
- Primes having only {3, 5, 7} as digits.at n=20A087363
- a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n].at n=35A089686
- Primes of the form 6*p - 1 such that p and 6*p - 5 are primes.at n=29A090609
- Table(n,j) of primes p = k*prime(n)#/210-j, where k is the least integer such that p and p+8 are consecutive primes, for n > 4 and j=7 to 1.at n=10A098078
- Number of partitions of 2n in which both odd parts and parts that are multiples of 3 occur with even multiplicities. There is no restriction on the other even parts.at n=21A101230
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 8.at n=16A103927
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 8.at n=10A119595
- Primes in A046992.at n=40A122516