3263
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3528
- Proper Divisor Sum (Aliquot Sum)
- 265
- 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
- 3000
- Möbius Function
- 1
- Radical
- 3263
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 74
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- 2-Bell numbers: a(n) = number of partitions of [n+1] with a distinguished block.at n=6A005493
- Coordination sequence T2 for Zeolite Code ZON.at n=40A009920
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=34A011971
- Sequence formed by reading rows of triangle defined in A011971.at n=27A011972
- Number of partitions of n into distinct parts, none being 8.at n=52A015755
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=50A024369
- Coordination sequence T5 for Zeolite Code ESV.at n=38A038414
- Numbers whose base-5 representation has exactly 6 runs.at n=6A043606
- Numbers k such that the string 2,5 occurs in the base 9 representation of k but not of k-1.at n=45A044274
- Numbers n such that string 6,3 occurs in the base 10 representation of n but not of n-1.at n=35A044395
- Numbers n such that string 6,3 occurs in the base 10 representation of n but not of n+1.at n=35A044776
- Numbers whose base-4 representation contains exactly one 0 and four 3's.at n=15A045070
- Numbers whose base-4 representation contains no 1's and exactly four 3's.at n=21A045113
- Numbers whose base-4 representation contains exactly one 2 and four 3's.at n=20A045142
- Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.at n=29A049020
- Take n points in general position in the plane; draw all the (infinite) straight lines joining them; sequence gives number of connected regions formed.at n=14A055503
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).at n=21A056861
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).at n=29A056862
- Triangle read by rows. T(n, k) = Sum_{i=0..n} Stirling2(n, i)*Product_{j=1..k} (i - j + 1) for 0 <= k <= n.at n=29A059098
- Harmonic mean of digits is 3.at n=26A062181