4077
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6080
- Proper Divisor Sum (Aliquot Sum)
- 2003
- 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
- 2700
- Möbius Function
- 0
- Radical
- 453
- Omega Function (Ω)
- 4
- 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
- 64
- 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
- Spiral sieve using Fibonacci numbers.at n=17A005625
- Coordination sequence T2 for Zeolite Code FER.at n=39A008107
- Odd numbers with exactly 4 palindromic prime factors (counted with multiplicity).at n=32A046374
- Bessel function |J_0(n)| is a monotonically decreasing positive sequence.at n=26A046962
- Ordered factorizations with one level of parentheses indexed by prime signatures. A050354(A025487).at n=23A050355
- Numbers n such that 207*2^n-1 is prime.at n=21A050855
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=12A052049
- Moebius transform of A000029 (starting at term 0).at n=17A054156
- Numbers k such that k | 5^k + 4^k + 3^k + 2^k + 1^k.at n=30A056741
- Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=31A056751
- Numbers n such that n | 8^n + 7^n + 6^n.at n=29A057233
- Numbers k such that k^2 has property that the sum of its digits and the product of its digits are nonzero squares.at n=41A061268
- (Sum of digits of n)^4 - (sum of digits of n^4).at n=35A069978
- (Sum of digits of n)^4 - (sum of digits of n^4).at n=17A069978
- (Sum of digits of n)^4 - (sum of digits of n^4).at n=8A069978
- (Sum of digits of n)^6 - (sum of digits of n^6).at n=4A069980
- a(n) = Floor[(2*Pi/E)*n^2].at n=41A090398
- G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).at n=28A090491
- Female of (1/(n+1),n/(1+n)) pair function used to get a dual population Fibonacci.at n=20A100582
- Number of partitions of n into parts with at most one 1 and at most one 2.at n=37A121081