1602
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 3510
- Proper Divisor Sum (Aliquot Sum)
- 1908
- 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
- 528
- Möbius Function
- 0
- Radical
- 534
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations of [n] in which the longest increasing run has length 6.at n=8A000467
- Number of partitions of n into at most 5 parts.at n=39A001401
- Numbers k such that 39*2^k + 1 is prime.at n=27A002269
- Number of unlabeled minimally 2-connected graphs with n nodes (also called "blocks").at n=10A003317
- a(n) = 1000*log_10(n) rounded to the nearest integer.at n=39A004226
- Sum of multinomial coefficients (n_1+n_2+...)!/(n_1!*n_2!*...) where (n_1, n_2, ...) runs over all integer partitions of n.at n=6A005651
- Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n^2 + 2.at n=20A005899
- From descending subsequences of permutations.at n=5A006219
- Coordination sequence T3 for Zeolite Code CAS.at n=24A008065
- Coordination sequence T2 for Zeolite Code PHI.at n=29A008228
- Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.at n=41A008304
- Coordination sequence T1 for Zeolite Code VSV.at n=26A009914
- a(0) = 1, a(n) = n^2 + 2 for n > 0.at n=40A010000
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=10A010006
- a(0) = 1, a(n) = 25*n^2 + 2 for n > 0.at n=8A010015
- Coordination sequence T2 for Zeolite Code TER.at n=27A016434
- Expansion of 1/(1-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=53A017872
- Fibonacci sequence beginning 0, 18.at n=11A022352
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=15A024468
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=12A024689