8235
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 6645
- 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
- 4320
- Möbius Function
- 0
- Radical
- 915
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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
- no
- Odd
- yes
Appears in sequences
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=34A029580
- Second 10-gonal (or decagonal) numbers: n*(4*n+3).at n=45A033954
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=33A045055
- Number of sequences of rooted identity trees with a total of n nodes.at n=12A052806
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=23A077441
- Recursive binary interleaving code for rooted plane binary trees, as ordered by A014486.at n=33A082856
- Sum of primitive roots of n-th prime.at n=40A088144
- Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=21A124141
- a(n) = (prime(n)^3 - prime(n^3))/2.at n=9A143680
- a(n) = largest number k such that k and k * n taken together have distinct digits, or 0 if no such k exists.at n=23A173780
- G.f. satisfies: A(x) = exp( Sum_{n>=1} A(A179491(n)*x^n)*x^n/n ), where A(x) = exp( Sum_{n>=1} A179491(n)*x^n/n ).at n=11A179490
- Numbers a = b + c where a, b, and c contain the same decimal digits.at n=13A203024
- Number of n-bead necklaces labeled with numbers -5..5 allowing reversal, with sum zero and first differences in -5..5.at n=6A209029
- T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and first differences in -k..k.at n=61A209032
- Number of 7-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first differences in -n..n.at n=4A209035
- Pairs of deficient numbers having the same value of sigma(k)/k in the order that they are found.at n=30A211680
- Deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m.at n=15A212608
- Hypotenuse of the smallest Pythagorean triple whose legs are m and 2m + n.at n=26A216260
- Number of nX7 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without consecutive moves in the same direction.at n=1A221482
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without consecutive moves in the same direction.at n=29A221483