6053
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6054
- 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
- 6052
- Möbius Function
- -1
- Radical
- 6053
- 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
- 67
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 790
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=57A011911
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/29 ).at n=22A011939
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=21A018836
- Expansion of 1/((1-6x)(1-8x)(1-11x)).at n=3A020593
- Primes that remain prime through 3 iterations of function f(x) = 3x + 10.at n=35A023280
- Lower prime of a pair of consecutive primes having a difference of 14.at n=33A031932
- T(n,n-3), array T as in A038792.at n=33A038793
- Numerators of continued fraction convergents to sqrt(757).at n=5A042458
- Primes with first digit 6.at n=24A045712
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687.at n=38A049688
- McKay-Thompson series of class 20d for Monster.at n=42A058559
- a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.at n=52A069203
- (Prime(n)+prime(n+1)+prime(n+2))/(n+1) is an integer; sequence gives prime(n).at n=6A072162
- a(n) = floor(binomial(n+7,7)/binomial(n+3,3)).at n=42A084628
- Primes p such that the next prime after p can be obtained from p by adding the sum of the digits of p.at n=37A089824
- Primes which when multiplied by their largest digit and 1 is added form another prime.at n=44A090194
- k's first occurrence in A102932.at n=37A101255
- Smallest prime dividing the composite number consisting of n 1's followed by a terminal 3, where n=A105432.at n=28A105433
- Primes of the form 5x^2+4xy+5y^2, with x and y nonnegative.at n=37A106971
- Primes p such that little googol - p is prime.at n=16A108256