6450
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 16368
- Proper Divisor Sum (Aliquot Sum)
- 9918
- 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
- 1680
- Möbius Function
- 0
- Radical
- 1290
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- 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
- Bond percolation series for square lattice.at n=15A006727
- a(n) = n*(7*n - 1)/2.at n=43A022264
- Numbers n such that there are equal numbers of 0's and 1's in first n digits of binary representation of Pi.at n=20A039624
- Numbers k such that 4*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A056707
- Unitary untouchable numbers: us(x) = n has no solution where us(x) (A063919) is the sum of the proper unitary divisors of x.at n=44A063948
- At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers.at n=27A070020
- a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.at n=18A080310
- Values of y arising from representations of n >= 11 in A085514.at n=12A102775
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=32A116721
- a(1)=9; a(n)=floor((47+sum(a(1) to a(n-1)))/5).at n=36A120177
- Numbers k such that 2*k-1, 4*k-1, 6*k-1 and 8*k-1 are primes.at n=7A124487
- Numbers k such that 2*k-1, 4*k-1, 6*k-1, 8*k-1 and 10*k-1 are primes.at n=2A124488
- a(n) = Product{k>=0} (1 + floor(n/3^k)).at n=42A132327
- a(n) = A134207(n) + A134207(n-1).at n=42A134208
- The isolated nonprimes that are the sum of two successive primes.at n=45A167597
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=10A178980
- Number of forests of rooted trees containing n nodes not counting the root nodes.at n=10A181360
- (24n - 1)p(n): traces of partition class polynomials, with a(0) = -1.at n=9A183011
- Number of nX4 binary arrays with each sum of a(1..i,1..j) no greater than i*j/2 and rows and columns in nondecreasing order.at n=5A183411
- T(n,k)=Number of nXk binary arrays with each sum of a(1..i,1..j) no greater than i*j/2 and rows and columns in nondecreasing order.at n=39A183413