2735
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3288
- Proper Divisor Sum (Aliquot Sum)
- 553
- 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
- 2184
- Möbius Function
- 1
- Radical
- 2735
- 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
- 159
- 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
- Coordination sequence T5 for Zeolite Code MTT.at n=32A008193
- Expansion of 1/((1-2x)(1-3x)(1-4x)(1-10x)).at n=3A025927
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=12A028948
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 9.at n=32A031412
- Numbers k such that 125*2^k+1 is prime.at n=17A032412
- Concatenation of n and n + 8 or {n,n+8}.at n=26A032613
- Numbers k such that the string 6,8 occurs in the base 9 representation of k but not of k-1.at n=36A044313
- Numbers n such that string 3,5 occurs in the base 10 representation of n but not of n-1.at n=30A044367
- Numbers n such that string 6,6 occurs in the base 9 representation of n but not of n+1.at n=33A044692
- Numbers n such that string 6,8 occurs in the base 9 representation of n but not of n+1.at n=36A044694
- Numbers n such that string 3,5 occurs in the base 10 representation of n but not of n+1.at n=30A044748
- Numbers whose base-3 representation contains exactly three 0's and four 2's.at n=26A045008
- Numbers whose base-4 representation contains no 1's and exactly four 2's.at n=31A045089
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=0A045155
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049747.at n=38A049749
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 12.at n=41A051977
- Number of positive integers <= 2^n of form 5 x^2 + 8 y^2.at n=15A054178
- Row sums of array in A055450.at n=6A055451
- Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1.at n=40A056193
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n.at n=23A057250