4690
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9792
- Proper Divisor Sum (Aliquot Sum)
- 5102
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1584
- Möbius Function
- 1
- Radical
- 4690
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = ceiling(n*phi^13), where phi is the golden ratio, A001622.at n=9A004968
- Primitive pseudoperfect numbers.at n=65A006036
- Coordination sequence T4 for Zeolite Code FER.at n=42A008109
- Molien series for A_7.at n=37A008630
- Expansion of 1/((1-x)(1-5x)(1-6x)(1-11x)).at n=3A022412
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026670.at n=17A026680
- a(n) = diagonal sum of left justified array T given by A027113.at n=22A027131
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=21A027662
- Numbers whose set of base-8 digits is {1,2}.at n=33A032929
- G.f. satisfies A(x) = 1 + x*cycle_index(Sym(6), A(x)).at n=12A036722
- a(n) = prime(n)*prime(n+1) - prime(n).at n=18A037166
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=36A049739
- Table in which n-th row gives all partitions of n interpreted in base n+1. (A subset of A051849 with each term having a non-descending digit-sequence in base n+1).at n=41A051851
- Number of winning length n strings with a 10-symbol alphabet in "same game".at n=6A065243
- Numbers k such that A007923(k) is prime.at n=13A075766
- Sum of odd-indexed primes.at n=32A077131
- a(n) = (3*n+1)*(3*n+4).at n=22A085001
- G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)).at n=44A088932
- A transform of the Fibonacci numbers.at n=47A099505
- Structured truncated dodecahedral numbers.at n=6A100153