3225
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5456
- Proper Divisor Sum (Aliquot Sum)
- 2231
- 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
- 1680
- Möbius Function
- 0
- Radical
- 645
- Omega Function (Ω)
- 4
- 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
- 61
- 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
- Numbers k such that 11*2^k + 1 is prime.at n=12A002261
- a(n) = (n+1)*(n^2 +8*n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times.at n=24A008778
- a(n) = floor(n*(n-1)*(n-2)/17).at n=39A011899
- (d(n)-r(n))/5, where d = A008778 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=42A026053
- Sum of the numbers between the two n's in A026362.at n=29A026365
- Coordination sequence T4 for Zeolite Code ITE.at n=39A027372
- Number of ways to partition n elements into pie slices of different odd sizes.at n=53A032154
- a(n) = floor(10^5/n).at n=30A033427
- Positive numbers having the same set of digits in base 6 and base 10.at n=14A037437
- Numbers having four 0's in base 5.at n=15A043352
- Numbers n such that string 2,5 occurs in the base 10 representation of n but not of n-1.at n=35A044357
- Numbers n such that string 2,5 occurs in the base 10 representation of n but not of n+1.at n=35A044738
- Numbers k such that 231*2^k-1 is prime.at n=34A050867
- Numbers m such that 2^m + m is prime.at n=15A052007
- a(n) = 2*n^2 + 9*n - 5.at n=37A056237
- n is odd and sum of digits of n equals the numbers of divisors of n.at n=20A057532
- Sum of solutions of phi(x) = 2^n.at n=7A058214
- Positive numbers whose product of digits is 5 times their sum.at n=30A062382
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=9A067355
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.at n=26A067356