1775
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2232
- Proper Divisor Sum (Aliquot Sum)
- 457
- 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
- 1400
- Möbius Function
- 0
- Radical
- 355
- 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
- 86
- 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
- Number of ways in which n identical balls can be distributed among 6 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=4A005339
- Number of partitions of n into parts >= 3.at n=40A008483
- Numbers k such that k | 14^k + 1.at n=33A015965
- Number of subsets of { 1, ..., n } containing an A.P. of length 6.at n=14A018791
- Largest value of k for which Golay-Rudin-Shapiro sequence A020986(k) = n.at n=43A020991
- Fibonacci sequence beginning 1, 7.at n=13A022097
- Discriminants of quartic fields with 2 complex conjugates (negated).at n=37A023681
- Numbers with exactly 9 ones in binary expansion.at n=22A023691
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Fibonacci numbers).at n=15A024367
- Sum_{ k=1 ... floor(n/2) } A023532(k)*Fib(n-k).at n=15A024371
- Every suffix prime and no 0 digits in base 8 (written in base 8).at n=50A024783
- Erroneous version of A024371.at n=14A025067
- Number of partitions of n in which the least part is 3.at n=43A026796
- Number of binary [ n,8 ] codes without 0 columns.at n=11A034349
- Composite numbers k such that digits in k and in juxtaposition of prime factors of k are the same (apart from multiplicity).at n=5A035141
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=32A036000
- Numbers k such that 5 and 7 occur juxtaposed in the base-10 representation of k but not of k-1.at n=35A043252
- Numbers whose base-12 representation has exactly 4 runs.at n=32A043653
- Numbers k such that 5 and 7 occur juxtaposed in the base-10 representation of k but not of k+1.at n=35A044032
- Numbers k such that string 1,4 occurs in the base 7 representation of k but not of k-1.at n=41A044149