6256
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 7136
- 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
- 2816
- Möbius Function
- 0
- Radical
- 782
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 124
- 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
- Cubes written in base 7.at n=12A004637
- 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=16A006007
- 11-gonal (or hendecagonal) pyramidal numbers: a(n) = n*(n+1)*(3*n-2)/2.at n=16A007586
- Even octagonal numbers: a(n) = 4*n*(3*n-1).at n=23A014642
- Expansion of Product_{m>=1} (1 - m*q^m)^2.at n=30A022662
- a(n) = (prime(n+2)^2 - 1)/3.at n=30A024700
- Number of 4's in all partitions of n.at n=31A024788
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=10A027603
- Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=31A036006
- Nearest integer to n^(5/2).at n=33A036488
- Number of cubefree self avoiding walks in 2 dimensions of length n.at n=9A038592
- Numbers having four 4's in base 6.at n=22A043388
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^2.at n=33A053818
- Consider the final n decimal digits of 2^j for all values of j. They are periodic. Sequence gives position (or phase) of the maximal value seen in these n digits.at n=5A060460
- Group the natural numbers so that the product of members of a group is a multiple of the sum: (1),(2,3,4,5,6),(7,8,9),(10,11,12),(13,14,15),(16,17,18),(19,20,21),(22,23,24),.... This is the sequence of the ratio of product /sum.at n=45A074155
- Number of integers in {1, 2, ..., Fibonacci(n)} that are coprime to n.at n=20A074934
- An interleaved sequence of pyramidal and polygonal numbers.at n=31A081283
- Lower triangular matrix T, read by rows, that shifts left one column under the matrix square of T, with T(n,0)=T(n,1) for n>0 and T(n,n)=1 for n>=0.at n=32A098539
- Total number of self-intersections of all n-step walks on the square lattice starting at the origin.at n=6A098981
- sigma(n) plus the n-th prime gives a square.at n=35A114082