3230
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 3250
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1152
- Möbius Function
- 1
- Radical
- 3230
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 74
- 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
- Numbers k such that 9*2^k + 1 is prime.at n=27A002256
- Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=16A005564
- Primitive pseudoperfect numbers.at n=47A006036
- Primitive nondeficient numbers.at n=37A006039
- Coordination sequence T12 for Zeolite Code MFI.at n=36A008164
- Coordination sequence T6 for Zeolite Code MTW.at n=37A008201
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=22A015850
- Place where n-th 1 occurs in A023125.at n=29A022787
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=27A023866
- n written in fractional base 7/3.at n=56A024640
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=26A024863
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=29A024869
- Numbers k such that 259*2^k+1 is prime.at n=2A032506
- Numbers n such that string 2,3 occurs in the base 10 representation of n but not of n-1.at n=36A044355
- Numbers n such that string 3,0 occurs in the base 10 representation of n but not of n-1.at n=35A044362
- Numbers n such that string 3,0 occurs in the base 10 representation of n but not of n+1.at n=35A044743
- Numbers whose base-5 representation contains exactly three 0's and two 1's.at n=21A045171
- Numbers n such that 147*2^n-1 is prime.at n=21A050599
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=11A050789
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=29A058082