5770
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10404
- Proper Divisor Sum (Aliquot Sum)
- 4634
- 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
- 2304
- Möbius Function
- -1
- Radical
- 5770
- 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
- 49
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 19.at n=37A020358
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=45A036811
- Numbers n such that lcm(sigma(n),phi(n)) is a perfect square.at n=38A043293
- Numbers whose base-4 representation contains exactly two 1's and four 2's.at n=22A045099
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=17A052049
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=22A054999
- Numbers k such that k^512 + 1 is prime.at n=18A057465
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=14A067374
- Numbers k such that phi(k) and sigma(k) are both perfect squares.at n=7A067781
- a(n) = Sum_{d|n} sigma(n*d).at n=45A069546
- Numbers n such that sum of digits of n equals the sum of digits of n^3.at n=21A070276
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=28A105720
- Sum of n-th prime squared and n-th perfect square.at n=20A106587
- Overlay of Pell numbers: a(n)=A000129(n)+A000129(n-6).at n=11A131710
- Numbers whose square is a permutational number A134640.at n=23A134742
- Number of nX4 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=4A166835
- Number of nX5 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=3A166837
- Where records occur in A169784.at n=33A175437
- a(n,k) = 2^n times the average number of different subwords of length k in a random binary word of length n (prob 0 = prob 1 = 1/2), n>=1, 1<=k<=n; triangle read by rows.at n=49A184364
- Numbers k such that A007953(k) >= A007953(k^3), where A007953 = digital sum in base 10.at n=22A204324