6264
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
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 18000
- Proper Divisor Sum (Aliquot Sum)
- 11736
- 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
- 2016
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 7
- 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
- yes
- 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
- Number of partitions into non-integral powers.at n=14A000160
- Magnetization for body-centered cubic lattice.at n=14A003193
- Number of paths through an array.at n=6A006675
- Expansion of 1/Product_{m>=1} (1 - m*q^m)^29.at n=3A022753
- a(n) is least k such that k and 9k are anagrams in base n (written in base 10).at n=7A023101
- Numbers whose base-5 representation contains exactly three 0's and no 1's.at n=41A045169
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=17A045186
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=40A052335
- Numbers k such that k | sigma_9(k) - phi(k)^9.at n=19A055703
- Numbers k such that 3*5^k + 2 is prime.at n=22A057916
- McKay-Thompson series of class 12H for Monster.at n=11A058486
- Numbers k such that sigma(x) = k has exactly 7 solutions.at n=23A060663
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.at n=19A071208
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.at n=16A071208
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=10A074303
- Decimal concatenations of the quadruples (d1,d2,d3,d4) with elements in {2,4,6} for which there exists a prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4).at n=15A078868
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=31A084804
- Table read by rows in which rows give coefficients (in increasing order of exponents) of a certain family of polynomials indexed by odd primes >= 5.at n=23A092030
- a(n) = n*(20 + 15*n + n^2)/6.at n=28A101853
- Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=7A105276