4064
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 4000
- 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
- 2016
- Möbius Function
- 0
- Radical
- 254
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 51
- 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
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=35A005424
- 'Eban' numbers (the letter 'e' is banned!).at n=57A006933
- Coordination sequence T7 for Zeolite Code MEL.at n=41A008156
- Coordination sequence T3 for Zeolite Code TON.at n=40A008243
- Coordination sequence T6 for Zeolite Code CON.at n=45A009873
- Numbers k such that the geometric mean of phi(k) and sigma(k) is an integer.at n=44A011257
- a(n) is the least multiple of n, k*n say, such that phi(k) | sigma(k).at n=15A015756
- a(n) is the least multiple of n, k*n say, such that phi(k) | sigma(k).at n=31A015756
- Positive integers n such that 2^n == 2^11 (mod n).at n=51A015935
- Numbers k such that d(k) (number of divisors) divides phi(k) (Euler function) divides sigma(k) (sum of divisors).at n=41A020493
- a(n) = 8^(n+1) - 2^(n+2).at n=3A020540
- Numbers that are the sum of 4 nonzero squares in exactly 6 ways.at n=44A025362
- Average theta series of odd unimodular lattices of dimension 16 (multiplied by 17).at n=2A029817
- a(n) = n*(4*n-1).at n=32A033991
- Number of binary [ n,4 ] codes.at n=12A034358
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=42A035546
- Coordination sequence T3 for Zeolite Code SFF.at n=42A038433
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5).at n=39A039860
- Denominators of continued fraction convergents to sqrt(63).at n=7A041111
- Denominators of continued fraction convergents to sqrt(567).at n=7A042087