4182
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 4890
- 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
- 1280
- Möbius Function
- 1
- Radical
- 4182
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 38
- 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
- Essentially the same as A001611.at n=17A000381
- a(n) = Fibonacci(n) + 1.at n=19A001611
- Restricted partitions.at n=16A002573
- Numbers that are the sum of 4 positive 5th powers.at n=46A003349
- Inverse Möbius transform of A003965.at n=58A003981
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=34A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=34A004965
- Number of identity matched trees with n nodes.at n=9A005755
- Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=18A007435
- Fibonacci(n) - (-1)^n.at n=18A007492
- Coordination sequence T1 for Zeolite Code TON.at n=40A008241
- a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=19A011369
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=44A011901
- a(n) is the concatenation of n and 2n.at n=40A019550
- Pisot sequences L(4,6), E(4,6).at n=15A020706
- Pisot sequences L(6,9), E(6,9).at n=14A020717
- a(n) = n*(29*n - 1)/2.at n=17A022286
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=33A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=32A024306
- Least m such that if r and s in {1/2, 1/5, 1/8,..., 1/(3n-1)}, satisfy r < s, then r < k/m < s for some integer k.at n=42A024823