5287
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
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 329
- 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
- 4960
- Möbius Function
- 1
- Radical
- 5287
- 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
- 77
- 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
- Coordination sequence T9 for Zeolite Code EUO.at n=45A008104
- Sequence satisfies T^2(a)=a, where T is defined below.at n=52A027591
- 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 71.at n=21A031569
- Number of proper factorizations of the numbers with a record number of proper factorizations.at n=50A033834
- Denominators of continued fraction convergents to sqrt(769).at n=9A042483
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=44A050057
- Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...at n=34A062725
- First occurrence of n as a term in the continued fraction for log(3).at n=53A076593
- a(1) = 393; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). edit.at n=33A105210
- n+phi(n)+phi(phi(n)) is a cube.at n=10A116042
- Concatenation of first two digits and last two digits of n-th Mersenne prime A000668(n).at n=6A138863
- X values of the complete set of 23 integer solutions to the Ochoa curve equation.at n=18A141144
- Number of binary strings of length n with equal numbers of 00010 and 01010 substrings.at n=13A164216
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7 and 16*k-15 are also products of two distinct primes.at n=27A177213
- 6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes.at n=22A178145
- a(n) = number of 6-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..53].at n=19A178605
- An irregular array read by rows. The k-th entry of row r is the number of r-digit primes with digit sum k.at n=104A178701
- Number of nX3 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=3A183548
- Number of nX4 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=2A183549
- T(n,k)=Number of nXk 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=17A183554