3091
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
- 4
- Divisor Sum
- 3384
- Proper Divisor Sum (Aliquot Sum)
- 293
- 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
- 2800
- Möbius Function
- 1
- Radical
- 3091
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 61
- Smith Number
- yes
- 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
- a(n) = floor(1000*log(n)).at n=21A004240
- a(n) = 1000*log(n) rounded to the nearest integer.at n=21A004241
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=40A008610
- Positive integers n such that 2^n == 2^11 (mod n).at n=45A015935
- Pseudoprimes to base 49.at n=46A020177
- Pseudoprimes to base 86.at n=26A020214
- Pseudoprimes to base 90.at n=10A020218
- Strong pseudoprimes to base 86.at n=3A020312
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=11A020389
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=39A023182
- a(n) = floor(floor(S3)/floor(S1)); where S3 and S1 are, respectively, the third and first elementary symmetric functions of {log(k)}, k = 1,2,...,n.at n=44A025210
- Number of partitions of n that do not contain 8 as a part.at n=28A027342
- 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 55.at n=6A031553
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 22 ones.at n=41A031790
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=8A031899
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) < cn(3,5).at n=67A036874
- Odd composite numbers n such that the digit sum of n equals digit sum of sum of its prime factors (counted with multiplicity).at n=37A036923
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=23A036927
- (s(n)+7)/10, where s(n)=n-th base 10 palindrome that starts with 3.at n=31A043082
- Numbers n such that string 9,1 occurs in the base 10 representation of n but not of n-1.at n=33A044423