5531
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5532
- 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
- 5530
- Möbius Function
- -1
- Radical
- 5531
- 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
- 41
- 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
- 732
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=32A001583
- Smallest prime p such that first n primes (p_1=2, ..., p_n) are 7th power residues mod p.at n=1A002227
- Number of paraffins.at n=28A005999
- a(n) = 1 + n/2 + 9*n^2/2.at n=35A006137
- Primes of form 2n^2 - 2n + 19.at n=40A007639
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=28A020393
- Primes that remain prime through 3 iterations of function f(x) = 9x + 10.at n=23A023299
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=27A024864
- 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 73.at n=20A031571
- Discriminants of imaginary quadratic fields with class number 23 (negated).at n=18A046020
- Increasing values of the Improperly Reduced Fibonacci Sequence (A058981).at n=34A058982
- Prime numbers with odd digits in descending order.at n=22A061245
- Primes with 10 as smallest positive primitive root.at n=13A061323
- Number of ways writing n! as a sum of two primes.at n=9A062311
- Generalized Catalan numbers C(10; n).at n=4A064093
- Fifth diagonal of triangle A064094.at n=10A064096
- Primes such that prime(p) +- pi(p) are simultaneously prime.at n=10A065117
- Primes p such that p^6 + p^3 + 1 is prime.at n=30A066100
- Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.at n=37A074808
- Primes for which the three closest primes are smaller.at n=40A074982