4856
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 4264
- 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
- 2424
- Möbius Function
- 0
- Radical
- 1214
- Omega Function (Ω)
- 4
- 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
- 46
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of n-node animals on cubic lattice.at n=5A006193
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=45A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=45A007707
- Coordination sequence T2 for Zeolite Code DOH.at n=43A008079
- Coordination sequence for Ni2In, Position Ni2.at n=21A009942
- Quadruples of different integers from [ 1,n ] with no common factors between pairs.at n=30A015623
- Expansion of 1/((1-2x)(1-8x)(1-12x)).at n=3A016320
- Numbers n such that 243*2^n-1 is prime.at n=32A050880
- Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.at n=15A056764
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the pair of ratios 11/8 and 16/11 which generate two complementary musical tones.at n=25A061416
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).at n=51A071946
- Number of partitions of n^2 into squares not less than n.at n=37A093116
- Number of compositions of n such that every part occurs with the same multiplicity.at n=20A098504
- Triangle in A071946 with rows reversed.at n=48A108076
- a(n) = n*(2*n^2 + 5*n + 15)/2.at n=16A163673
- Number of partitions of n in which the sum of reciprocals of parts is less than 1.at n=53A168173
- Partial sums of A000419.at n=62A174866
- A symmetrical triangle:t(n,m)=1 - (1 + n)^(n + 1)* (1 - 1/(n + 1))^(n + 1) + (n + 1)^(n + 2)*Binomial[n, m]((m + 1)/(n + 1))^(m + 1)*(1 - ( m + 1)/(n + 1))^(n - m + 1).at n=13A176390
- A symmetrical triangle:t(n,m)=1 - (1 + n)^(n + 1)* (1 - 1/(n + 1))^(n + 1) + (n + 1)^(n + 2)*Binomial[n, m]((m + 1)/(n + 1))^(m + 1)*(1 - ( m + 1)/(n + 1))^(n - m + 1).at n=11A176390
- Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.at n=4A180779