1769
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1860
- Proper Divisor Sum (Aliquot Sum)
- 91
- 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
- 1
- Radical
- 1769
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- a(n) = n*(n+3)/2.at n=58A000096
- Sum of rows of triangle defined in A001404.at n=9A001410
- From a nim-like game.at n=26A003412
- Infima closed sets in rooted plane trees on n nodes.at n=5A007855
- a(n) = n*(2*n + 3).at n=29A014106
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=15A014302
- Number of 5-tuples of different integers from [ 1,n ] with no common factors among triples.at n=15A015646
- Number of 5-tuples of different integers from [ 2,n ] with no common factors among triples.at n=15A015649
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=16A020350
- a(n)-th nonsquarefree is sum of first k nonsquarefrees for some k.at n=25A020644
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=13A024848
- [ Sum (s(j) - s(i))^2 ], 1 <= i < j <= n, where s(k) = 1 + 1/2 + ... + 1/k.at n=49A025216
- Numbers k such that the sum of the digits of Fibonacci(k) in base 11 is k.at n=48A025490
- Coordination sequence T3 for Zeolite Code CGS.at n=31A027367
- Coordination sequence T3 for Zeolite Code ITE.at n=29A027371
- Positions of record values in A030777.at n=38A030782
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=6A031419
- Duplicate of A036900.at n=3A032511
- Coordination sequence T2 for Zeolite Code TSC.at n=35A033617
- Scan decimal expansion of e until all n-digit strings have been seen; a(n) is last string seen.at n=3A036900