4811
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5112
- Proper Divisor Sum (Aliquot Sum)
- 301
- 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
- 4512
- Möbius Function
- 1
- Radical
- 4811
- 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
- 46
- 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
- Coordination sequence T2 for Scapolite.at n=44A008263
- Expansion of 1/((1-x)*(1-3*x)*(1-7*x)).at n=4A016212
- Number of 2's in n-th term of A022470.at n=33A022473
- a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=26A022869
- a(n) = T(n, n+3), T given by A027052.at n=10A027054
- a(n) = A027052(n, 2n-10).at n=8A027066
- 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 69.at n=6A031567
- Numbers whose set of base-8 digits is {1,3}.at n=35A032915
- Number of independent sets of nodes in graph C_4 X P_n (n>2).at n=5A051926
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=16A064909
- a(n) = A076969(n)^(1/3).at n=33A076970
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=25A083995
- Number of squares on infinite quarter chessboard at <=n knight moves from the corner.at n=37A098500
- a(n) is the least number of prime factors in any non-deficient number that has the n-th prime as its least prime factor.at n=45A107705
- a(n) is the least number of prime factors for any abundant number with p_n (the n-th prime) as its least factor.at n=45A108227
- a(n) = A011782(n) + A000219(n) - A000712(n).at n=13A116600
- Triangle read by rows, T(n,k) = (2^k-1) * T(n-1,k) + T(n-1,k-1).at n=23A139382
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, 0), (1, 0, -1), (1, 1, 0)}.at n=8A149097
- Discriminants of imaginary quadratic fields with class number 22 (negated).at n=35A171724
- Positive integers of the form (30*m^2+1)/11.at n=7A179339