5256
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14430
- Proper Divisor Sum (Aliquot Sum)
- 9174
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1728
- Möbius Function
- 0
- Radical
- 438
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- a(n) = 2*n*(2*n+1).at n=36A002943
- n! times number of posets with n elements.at n=4A003425
- Expansion of e.g.f. sin(arctan(x) * log(x+1)).at n=9A012397
- arcsinh(arctan(x)*log(x+1)) = 2/2!*x^2 - 3/3!*x^3 - 10/5!*x^5 + 88/6!*x^6 - ...at n=7A012402
- a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=7.at n=15A022312
- Expansion of 1/((1-x)*(1-5*x)*(1-7*x)*(1-11*x)).at n=3A022455
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=32A023863
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=49A026907
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=50A026907
- T(2n-1,n-1), T given by A026907.at n=4A026912
- T(n,[ n/2 ]), T given by A026907.at n=9A026914
- a(n) = n^3 + (n+1)^3 + (n+2)^3.at n=11A027602
- Sorted Galois numbers.at n=24A028689
- Theta series of lattice D_3 tensor D_4 (dimension 12, det. 16384, min. norm 4).at n=4A033696
- Product of a prime and the previous number.at n=20A036689
- Numbers that are divisible by 6 (and 18) and are differences between two cubes in at least one way.at n=18A038852
- Numbers ending with '6' that are the difference of two positive cubes.at n=23A038861
- Numerators of continued fraction convergents to sqrt(790).at n=5A042522
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=24A045945
- Numbers that are the sum of two (possibly negative) cubes in at least 2 ways.at n=21A051347