1790
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3240
- Proper Divisor Sum (Aliquot Sum)
- 1450
- 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
- 712
- Möbius Function
- -1
- Radical
- 1790
- 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
- 99
- 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
- Number of free planar polyenoids with n nodes and symmetry point group C_s.at n=10A000941
- Number of partitions of n into parts 2, 3, 4, 5, 6, 7.at n=51A001996
- Coordination sequence T6 for Zeolite Code MTW.at n=28A008201
- Coordination sequence T7 for Zeolite Code PAU.at n=31A008225
- Year of birth of n-th President of U.S.A.at n=9A008745
- Coordination sequence T1 for Zeolite Code WEI.at n=30A009917
- Number of triples of different integers from [ 2,n ] with no common factors between pairs.at n=34A015620
- Largest value of k for which Golay-Rudin-Shapiro sequence A020986(k) = n.at n=46A020991
- a(n) = n*(9*n - 1)/2.at n=20A022266
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=28A023181
- Numbers with exactly 9 ones in binary expansion.at n=26A023691
- a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=22A025003
- T(n,n-2), where T is the array in A026374.at n=39A026381
- a(n) = T(n,n-2), where T is the array in A026386.at n=39A026393
- a(n) = Sum_{k=0..n} A026615(n, k).at n=10A026622
- T(2n,n+1), T given by A026747.at n=5A026861
- Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k) = C(n+2,k+1) + C(n+1,k) + C(n+1,k+1) + C(n,k). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. Domain: 0 <= k <= n, n >= 0.at n=59A027170
- Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k) = C(n+2,k+1) + C(n+1,k) + C(n+1,k+1) + C(n,k). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. Domain: 0 <= k <= n, n >= 0.at n=61A027170
- a(n) = A027170(2n, n-1).at n=4A027173
- a(n) = n-th largest even number in array T given by A027170.at n=32A027183