5710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10296
- Proper Divisor Sum (Aliquot Sum)
- 4586
- 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
- 2280
- Möbius Function
- -1
- Radical
- 5710
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 129
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of compositions of n into 4 ordered relatively prime parts.at n=32A000742
- Coordination sequence T3 for Zeolite Code TON.at n=47A008243
- a(1)=1, a(n) = n*11^(n-1) + a(n-1).at n=3A014926
- n written in fractional base 8/5.at n=40A024647
- Self-convolution of array T given by A026300.at n=6A026939
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 32 ones.at n=34A031800
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=42A036463
- Number of positive integers <= 2^n of form 3 x^2 + 3 y^2.at n=16A054161
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3.at n=11A056578
- a(n) = a(n-1) + the number of primes <= a(n-1).at n=36A061535
- Numbers k such that prime(k) + prime(k+1)*2 is a square.at n=14A064504
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=17A081378
- a(n) = x is the smallest number such that gcd(prime(x)-1,x-1) = n.at n=32A084315
- Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares.at n=19A087150
- A sequence generated from a 4th degree Pascal's Triangle polynomial.at n=9A095265
- Trajectory of 1001 under "3x+1" map.at n=13A100709
- Values of n for which the concatenations 1nn1, 3nn3, 7nn7 and 9nn9 are all primes.at n=6A102504
- Numbers n such that p(7n) is prime, where p(n) is the number of partitions of n.at n=18A114167
- Maximal length of rook tour on an n X n+1 board.at n=19A152132
- Maximal length of rook tour on an n X n+3 board.at n=18A152134