3477
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4960
- Proper Divisor Sum (Aliquot Sum)
- 1483
- 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
- 2160
- Möbius Function
- -1
- Radical
- 3477
- Omega Function (Ω)
- 3
- 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
- 30
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (4*n+1)*(4*n+5).at n=14A003185
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=22A005892
- Numbers k such that 65*2^k+1 is prime.at n=28A032382
- Divisors = 1 (mod 4) of Descartes's 198585576189.at n=38A033870
- Decimal part of a(n)^(1/10) starts with n (10th powers excluded).at n=26A034065
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=26A034075
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+9 or 20k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=40A036028
- Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).at n=75A036877
- Numbers n such that string 7,7 occurs in the base 10 representation of n but not of n-1.at n=34A044409
- Numbers n such that string 7,7 occurs in the base 10 representation of n but not of n+1.at n=34A044790
- Numbers n such that A048767(n+1)=A048767(n).at n=8A048769
- Least positive integer k such that the number having periodic continued fraction [ 1,m,1,m,1,m,... ] is of form (a+b*sqrt(k))/c, where a,b,c are positive integers.at n=56A049457
- Starting index of a string of 3 or more consecutive equal digits in decimal expansion of Pi.at n=27A049515
- Starting index of a string of exactly 3 consecutive equal digits in decimal expansion of Pi.at n=21A049519
- a(n)=T(n,n+2), array T as in A049723.at n=32A049730
- Starting positions of strings of 2 4's in the decimal expansion of Pi.at n=32A050230
- Handsome numbers (A007532) representable as a sum of any positive powers of their digits in two distinct ways, not counting different powers of duplicated digits as distinct.at n=27A050240
- Expansion of (1-x)/(1-x-3*x^2).at n=11A052533
- Sum of a(n) terms of 1/k^(2/3) first exceeds n.at n=43A056178
- Coordination sequence T2 for Zeolite Code MTF.at n=35A057305