4345
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 1415
- 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
- 3120
- Möbius Function
- -1
- Radical
- 4345
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 51
- 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
- no
- Odd
- yes
Appears in sequences
- Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).at n=14A002976
- Let S denote the palindromes in the language {0,1,2,3,4}*; a(n) = number of words of length n in the language SS.at n=7A007058
- a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 4.at n=29A007309
- Coordination sequence T2 for Zeolite Code AWW.at n=47A008046
- Pseudoprimes to base 23.at n=35A020151
- Pseudoprimes to base 56.at n=31A020184
- Pseudoprimes to base 78.at n=19A020206
- a(n) = (1/s(1) - 1/s(2) + ... + d/s(n+1)) * LCM{1, 2, ..., n}, where d = (-1)^n, s = A002944, i.e., s(k) = LCM of row k of Pascal's triangle.at n=12A025538
- Numbers n such that A048767(n+1)=A048767(n).at n=10A048769
- Starting positions of strings of 2 7's in the decimal expansion of Pi.at n=37A050254
- Sum of numbers in range 10*n to 10*n+9.at n=43A053743
- McKay-Thompson series of class 9B for the Monster group.at n=30A058091
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=15A064111
- Multiples of 11 in which the even positioned digits from left are odd and the odd positioned ones are even.at n=28A080467
- Numbers k whose digits are all contained, in any order, within the digits of prime(k).at n=39A080794
- Number of distinct products i*j*k*l for 1 <= i <= j <= k <= l <= n.at n=22A100437
- Number of decimal digits in the denominator of the 10^n-th harmonic number.at n=4A114468
- Numbers k such that k + sigma(k) + phi(k) is a square.at n=11A116009
- a(0) = 0, a(1) = 1; a(n) = max { 4*a(k) + a(n-k) | 1 <= k <= n/2 }, for n > 1.at n=46A116520
- Expansion of (1-4x)/(1-x^2+x^3).at n=28A117379