6136
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 6464
- 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
- 2784
- Möbius Function
- 0
- Radical
- 1534
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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) = n*(3*n^2 - 1)/2.at n=16A004188
- Number of n-step spirals on hexagonal lattice.at n=17A006777
- Bisection of A001400.at n=45A014125
- Sum of the sizes of binary subtrees of the perfect binary tree of height n.at n=4A024358
- a(n) = Sum_{k=1..n} (n-k) * floor(n/k).at n=43A024920
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=25A025513
- Number of partitions of n into parts not of the form 17k, 17k+6 or 17k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=32A035967
- a(n) = Sum_{k=1..n} lcm(n,k).at n=25A051193
- Number of perfect powers (A001597) not exceeding 2^n.at n=25A070228
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=11A084804
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.at n=22A092230
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.at n=24A092231
- Expansion of g.f. -(1+x^2+x^4)/((x^3+x^2+x-1)*(x-1)^2).at n=12A104187
- Multiples of 13 containing a 13 in their decimal representation.at n=18A121033
- Ceiling(exp(n)/n^2).at n=13A132408
- Numbers n such that primorial(n)/2 - 512 is prime.at n=17A139454
- a(n) = n*(9*n+2).at n=26A147296
- a(n) = 361*n - 1.at n=16A158308
- a(n) = 3*a(n-1) - 2*a(n-2) with a(0)=16 and a(1)=40.at n=8A182461
- Number of (n+1) X 4 0..3 arrays with every 2 X 2 subblock summing to 6.at n=3A183636