4318
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6912
- Proper Divisor Sum (Aliquot Sum)
- 2594
- 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
- -1
- Radical
- 4318
- 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
- 126
- 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
- Coordination sequence T2 for Zeolite Code GOO.at n=45A008112
- Coordination sequence T3 for Zeolite Code ZON.at n=46A009921
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=23A015850
- Expansion of Product_{m>=1} (1 + q^m)^(2*m).at n=11A026011
- Let F(n) = Q(n) - P(n) be the Fortunate numbers (A005235); sequence gives n such that F(n) = prime(n+1).at n=16A035346
- a(n)=T(2n-1,n), array T given by A048212.at n=34A048221
- a(0) = 0; for n>0, a(n) = A005598(n)/2.at n=43A049703
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=45A050041
- Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.at n=48A051336
- Number of positive integers <= 2^n of form x^2 + 18 y^2.at n=15A054231
- Numbers k such that 4*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A056707
- Numbers n such that 2^n in base 3 has same number of 2's as 2^(n+1) in base 3 and 2^n and 2^(n+1) have the same number of digits in base 3.at n=39A056736
- Numbers n such that phi(n)^2 + sigma(n)^2 is an integer square.at n=46A067811
- Smallest multiple of n with initial digits that of the reversal of n, deleting the leading zeros wherever required.at n=33A074156
- Left truncatable 3-almost primes, in which repeatedly deleting the leftmost digit gives a 3-almost prime at every step until a single-digit 3-almost prime remains.at n=32A085248
- Column 5 of triangle A091602.at n=35A091608
- Numbers n such that 4*10^n + R_n + 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=8A102982
- Number of compositions of n in which the greatest part is odd.at n=13A103421
- Numbers k such that (k + prime(k)) and (k+1 + prime(k+1)) are divisible by 11.at n=41A107380
- 1 + sum of first n 3-almost primes.at n=44A110209