5471
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5472
- 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
- 5470
- Möbius Function
- -1
- Radical
- 5471
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 160
- 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
- 722
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=13A000945
- Coordination sequence T2 for Zeolite Code MFS.at n=46A008174
- Numbers k such that the continued fraction for sqrt(k) has period 60.at n=20A020399
- Primes of form k^2 - 5.at n=19A028877
- 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=13A031571
- Numbers k such that 251*2^k+1 is prime.at n=9A032502
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) and cn(0,5) <= cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(3,5).at n=31A039843
- Primes p such that p+6 and p+8 are also primes.at n=39A046138
- p, p+8 and p+12 are primes.at n=34A046141
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.at n=29A049438
- Euclid-Mullin sequence (A000945) with initial value a(1)=43 instead of a(1)=2.at n=13A051318
- Primes p from A031924 such that A052180(primepi(p)) = 13.at n=11A052233
- Primes q of the form q = 10p + 1, where p is also prime.at n=24A055781
- Primes p whose reciprocal has period (p-1)/10.at n=8A056215
- Numbers k such that 5^k - 4^k is prime.at n=10A059802
- Primes p such that x^5 == 2 (mod p) has five solutions.at n=35A059858
- Smallest odd prime p such that Q(sqrt(-p)) has class number 2n+1.at n=35A060651
- A B_2 sequence: a(n) is the smallest prime such that the pairwise sums of distinct elements are all distinct.at n=37A062294
- The prime then composite recurrence; a(2n) = a(2n-1)-th prime and a(2n+1) = a(2n)-th composite and a(1) = 1.at n=9A064960
- a(n) is smallest prime > 2*a(n-1), a(1) = 3.at n=10A065545