3061
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3062
- 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
- 3060
- Möbius Function
- -1
- Radical
- 3061
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 48
- 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
- 438
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes with 6 as smallest primitive root.at n=25A001125
- Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=25A001975
- Primes p such that (p+1)/2 is prime.at n=44A005383
- A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.at n=42A011185
- Number of 1's in n-th term of A006711.at n=30A022477
- Primes that remain prime through 2 iterations of function f(x) = 5x + 2.at n=34A023252
- Smallest prime in Goldbach partition of A025018(n).at n=40A025019
- a(n) is the n-th diagonal sum of left justified array T given by A027960.at n=24A027975
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 40 ones.at n=8A031808
- Upper prime of a difference of 12 between consecutive primes.at n=28A031931
- Numbers whose set of base-11 digits is {2,3}.at n=21A032811
- Primes of form x^2+51*y^2.at n=30A033233
- Primes of form x^2+77*y^2.at n=18A033249
- Value of D for incrementally largest values of minimal x satisfying Pell equation x^2-Dy^2=1.at n=23A033316
- Numbers k such that d(i) is a power of 2 for all k <= i <= k+6, where d(i) = number of divisors of i.at n=48A036540
- Primes p such that (p+1)/2 and (p+2)/3 are also primes.at n=11A036570
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=67A036849
- Numerators of continued fraction convergents to sqrt(390).at n=4A041740
- Numerators of continued fraction convergents to sqrt(956).at n=6A042850
- (s(n)+7)/10, where s(n)=n-th base 10 palindrome that starts with 3.at n=28A043082