5911
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6192
- Proper Divisor Sum (Aliquot Sum)
- 281
- 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
- 5632
- Möbius Function
- 1
- Radical
- 5911
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 142
- Smith Number
- no
- 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
- Boustrophedon transform of primes.at n=7A000747
- Expansion of (1-x)/(1 - 3*x + x^2)^2.at n=7A001870
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=36A007697
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=38A007697
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=37A007697
- Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=7A016067
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers).at n=15A024458
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).at n=14A025078
- Numbers k such that 207*2^k + 1 is prime.at n=37A032480
- Numbers whose set of base-14 digits is {2,3}.at n=15A032814
- Multiplicity of highest weight (or singular) vectors associated with character chi_13 of Monster module.at n=39A034401
- Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=28A055202
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.at n=39A060004
- Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.at n=7A067977
- Convoluted convolved Fibonacci numbers G_j^(2).at n=15A089089
- Sign twisted convoluted convolved Fibonacci numbers H_j^(2).at n=15A089098
- Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.at n=23A091239
- a[n] =a[n-1] + 2*n*Prime[n]-n^2.at n=14A093809
- A Graham-Pollak-like sequence with cube root instead of square root.at n=32A100673
- a(-1) = 1, a(n) = Sum_{k=0..n} A034851(n,k)*a(k-1) where A034851(n,k) are entries in Losanitsch's triangle.at n=9A102814