4689
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6786
- Proper Divisor Sum (Aliquot Sum)
- 2097
- 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
- 3120
- Möbius Function
- 0
- Radical
- 1563
- Omega Function (Ω)
- 3
- 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
- 152
- 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
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=9A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=9A004948
- Let S denote the palindromes in the language {0,1,2}*; a(n) = number of words of length n in the language SS.at n=10A007056
- Expansion of tan(x/cos(x)).at n=3A009765
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=8A020407
- a(n) = n*(29*n - 1)/2.at n=18A022286
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=38A023180
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A004432.at n=42A024809
- Numbers whose set of base-8 digits is {1,2}.at n=32A032929
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=40A035564
- Numbers having four 2's in base 5.at n=31A043360
- Numbers having four 1's in base 8.at n=11A043428
- T(n,n-2), array T as in A047060.at n=7A047064
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+2)/3.at n=27A048081
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+3)/3.at n=27A048092
- Starting positions of strings of 2 3's in the decimal expansion of Pi.at n=35A050222
- McKay-Thompson series of class 20b for Monster.at n=18A058557
- a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=15A064022
- a(n) = (9*n^2 + 5*n + 2)/2.at n=32A064225
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.at n=19A070996