6932
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12138
- Proper Divisor Sum (Aliquot Sum)
- 5206
- 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
- 3464
- Möbius Function
- 0
- Radical
- 3466
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 31
- 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) = ceiling(10000*log(n)).at n=1A004245
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=45A015990
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=50A025222
- Number of partitions satisfying (cn(2,5) = cn(3,5) = 0).at n=53A036820
- Pisot sequence L(8,9).at n=23A048590
- Interprimes which are of the form s*prime, s=4.at n=28A075279
- Number of partitions of n into parts having at most two prime-factors.at n=32A101049
- Row sums of inverse of sequence array for Euler phi function.at n=37A106480
- Least positive k such that k*n + 1 is a golden semiprime (A108540).at n=38A108200
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).at n=38A114690
- Number of base 24 n-digit numbers with adjacent digits differing by three or less.at n=4A126492
- 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, 0, 0), (0, -1, 1), (1, 0, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150419
- Similar to A072921 but starting with 2.at n=35A152231
- a(0)=2, a(n) = n^2+a(n-1).at n=27A153056
- a(n) = A056520(n)+1 for n>0, a(0)=1.at n=27A179904
- Inverse permutation to A190126.at n=25A190127
- a(n) = 8*n^2 + 7*n + 1.at n=29A194268
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=w+2x+3y<=1.at n=42A211623
- Antidiagonal sums of the convolution array A213768.at n=11A213770
- Number of random selections (with replacement) needed from a normal population to assure a greater than one-half chance that the selected group contains the top 10th percentile individual, top 1st percentile individual, the 0.1 percentile, 0.01 percentile etc...at n=3A219330