6302
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9936
- Proper Divisor Sum (Aliquot Sum)
- 3634
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2992
- Möbius Function
- -1
- Radical
- 6302
- Omega Function (Ω)
- 3
- 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
- yes
- 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 points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=30A005919
- a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=15A010018
- n written in fractional base 9/6.at n=29A024654
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 78.at n=15A031576
- Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=1A045187
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 24.at n=34A051989
- Row sums of partition triangle A026820.at n=18A058397
- a(n) is the smallest number such that gcd(a(n), sigma(a(n))) = n.at n=45A074391
- a(n) = A000594(n+1) - A000594(n).at n=3A078463
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=37A084804
- Even numbers n such that N(n) is divisible by a nontrivial square, say m^2 with gcd(n,m) = 1, where N(n) is the numerator of the Bernoulli number B(n). The smallest numbers m are given in A094095.at n=11A090943
- Least number 2k such that p^2 divides the numerator of the Bernoulli number B(2k), where p is the n-th irregular prime, A000928(n).at n=7A092681
- a(n) = 2*n*(6*n-1).at n=23A126964
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=7A150254
- Numbers m such that all three values m^2 + 13^k, k = 1, 2, 3, are prime.at n=29A178639
- Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=3A180800
- T(n,k)=number of distinct solutions to sum{i=1..k}(x(2i-1)*x(2i)) == 0 (mod n), with x() in 0..n-1.at n=58A180803
- Number of nXnXn triangular 0..4 arrays with each element equal to at least two neighbors and with new values 0..4 introduced in row major order.at n=5A192900
- Number of subsets of {1..n} (including empty set) such that the pairwise sums of distinct elements are all distinct.at n=17A196723
- Number of -n..n arrays x(0..2) of 3 elements with zero sum and nonzero first and second differences.at n=45A200455